perm filename F82.IN[LET,JMC] blob
sn#694755 filedate 1983-01-01 generic text, type C, neo UTF8
COMMENT ⊗ VALID 00350 PAGES
C REC PAGE DESCRIPTION
C00001 00001
C00039 00002 ∂01-Oct-82 1717 Kent M. Pitman <KMP at MIT-MC>
C00046 00003 ∂01-Oct-82 1801 Paul Armer <CSD.ARMER at SU-SCORE> Re: Visit of Barbara Liskov
C00047 00004 ∂01-Oct-82 1807 Gene Golub <CSD.GOLUB at SU-SCORE> Barbara Liskov's Visit
C00049 00005 ∂01-Oct-82 1913 BUG-CKSUM problems with enormous files
C00051 00006 ∂01-Oct-82 1922 Allen.Newell at CMU-10A Re: Historical note: physical symbol systems
C00053 00007 ∂01-Oct-82 2024 RPG
C00054 00008 ∂01-Oct-82 2139 Gene Golub <CSD.GOLUB at SU-SCORE> Re: industry professorship
C00055 00009 ∂01-Oct-82 2147 Gene Golub <CSD.GOLUB at SU-SCORE> Titles
C00056 00010 ∂02-Oct-82 0854 Gene Golub <CSD.GOLUB at SU-SCORE> [Art Samuel <ALS at SU-AI>: Titles ]
C00057 00011 ∂02-Oct-82 1109 CLT if
C00058 00012 ∂02-Oct-82 1146 CLT ps
C00059 00013 ∂02-Oct-82 1158 JJW Class videotapes
C00061 00014 ∂02-Oct-82 1227 CLT MTC and FORMAL REASONING SEMINAR
C00064 00015 ∂02-Oct-82 1736 Andrei Broder <CSD.Broder at SU-SCORE> Next AFLB talks
C00070 00016 ∂02-Oct-82 1750 Gene Golub <CSD.GOLUB at SU-SCORE> Gio's Position
C00073 00017 ∂03-Oct-82 1421 Gene Golub <CSD.GOLUB at SU-SCORE> Thanks
C00074 00018 ∂04-Oct-82 0154 ARK Reiter Articles
C00075 00019 ∂04-Oct-82 0915 Bob Moore <BMOORE at SRI-AI> Re: industry lectureship
C00077 00020 ∂04-Oct-82 1532 Waldinger at SRI-AI mtc talk at stanford wed.
C00080 00021 ∂04-Oct-82 1558 Gene Golub <CSD.GOLUB at SU-SCORE> Reminder
C00081 00022 ∂04-Oct-82 1608 Ernst W. Mayr <CSD.MAYR at SU-SCORE> CS Colloquium
C00082 00023 ∂04-Oct-82 2124 UCBVAX.decvax!watmath!cbostrum@Berkeley Query on "First Order Theories of Ind. Concepts and Props."
C00085 00024 ∂05-Oct-82 0839 JJW Lisp Machine Manuals
C00086 00025 ∂05-Oct-82 1049 BUCHANAN at SUMEX-AIM Comtex Scientific reprints
C00096 00026 ∂05-Oct-82 1116 LGC Today's meeting with LGC and RPG
C00097 00027 ∂05-Oct-82 1603 ullman@Diablo (SuNet)
C00101 00028 ∂05-Oct-82 1742 pratt@Navajo (SuNet)
C00102 00029 ∂05-Oct-82 2038 ullman@Diablo (SuNet) MTC
C00103 00030 ∂06-Oct-82 0741 Navarro at SRI-AI FYI
C00106 00031 ∂06-Oct-82 0900 JMC*
C00107 00032 ∂06-Oct-82 1028 Nancy Dorio <CSD.DORIO at SU-SCORE> COLLOQUIUM NOTICE WEEK OF OCTOBER 11 - 15, 1982
C00110 00033 ∂06-Oct-82 1034 Chappell at SRI-AI TINLUNCH ON FRIDAY
C00112 00034 ∂06-Oct-82 1149 Gene Golub <CSD.GOLUB at SU-SCORE> Reminder
C00113 00035 ∂06-Oct-82 1342 CSCHMIDT at SUMEX-AIM New display location
C00114 00036 ∂06-Oct-82 1350 CSCHMIDT at SUMEX-AIM this mailing list
C00117 00037 ∂06-Oct-82 1405 CSCHMIDT at SUMEX-AIM LM-2
C00120 00038 ∂06-Oct-82 2110 CSVAX.ellen@Berkeley Theory Seminars
C00122 00039 ∂07-Oct-82 0214 Bill Gosper <RWG at MIT-MC>
C00123 00040 ∂07-Oct-82 0911 JJW Re: MacLisp summaries
C00124 00041 ∂07-Oct-82 0952 CL.BOYER at UTEXAS-20 Next Lisp Conference
C00127 00042 ∂07-Oct-82 1053 MLB Symbolics manuals
C00129 00043 ∂07-Oct-82 1304 Raj.Reddy at CMU-10A Common Lisp Effort
C00139 00044 ∂07-Oct-82 1409 Gene Golub <CSD.GOLUB at SU-SCORE> URGENT
C00140 00045 ∂07-Oct-82 1513 FFL
C00141 00046 ∂07-Oct-82 1517 FFL [Betty Scott <CSD.BSCOTT at SU-SCORE>: Re: Furniture]
C00144 00047 ∂07-Oct-82 1723 Carolyn Tajnai <CSD.TAJNAI at SU-SCORE> Student Resumes
C00145 00048 ∂08-Oct-82 0851 Chappell at SRI-AI TODAY'S TINLUNCH
C00147 00049 ∂08-Oct-82 0900 JMC*
C00148 00050 ∂08-Oct-82 0915 Chappell at SRI-AI FAEHNRICH & FAUSER PRESENTATION
C00151 00051 ∂08-Oct-82 1019 JJW MTC Qual
C00152 00052 ∂08-Oct-82 1046 Jeffrey D. Ullman <CSD.ULLMAN at SU-SCORE> VLSI seminar
C00153 00053 ∂08-Oct-82 1519 Paul Armer <CSD.ARMER at SU-SCORE> Support Needed
C00155 00054 ∂08-Oct-82 1556 Irmgild Schack <CSD.IRMGILD at SU-SCORE> Dinner with Barbara Liskov
C00156 00055 ∂08-Oct-82 1857 JK
C00158 00056 ∂08-Oct-82 2043 Grosz at SRI-AI change in day
C00159 00057 ∂09-Oct-82 1910 LGC Paper for Tuesday
C00162 00058 ∂09-Oct-82 1955 Bill Gosper <RWG at MIT-MC> complex numbers
C00166 00059 ∂09-Oct-82 2233 Lowell Wood <LLW at S1-A> Capsized Temporalization
C00171 00060 ∂10-Oct-82 0942 Gene Golub <CSD.GOLUB at SU-SCORE> Re: possible honor
C00172 00061 ∂10-Oct-82 1101 CLT MTC and FORMAL SYSTEMS SEMINAR
C00175 00062 ∂11-Oct-82 0900 JMC*
C00176 00063 ∂11-Oct-82 0920 FFL Call from Robert Kahn, Lawrence Livermore Lab
C00178 00064 ∂11-Oct-82 1357 RPG Meeting
C00179 00065 ∂11-Oct-82 1425 Paul Armer <CSD.ARMER at SU-SCORE> Support Needed
C00180 00066 ∂11-Oct-82 1459 CLT
C00181 00067 ∂12-Oct-82 1135 FFL
C00182 00068 ∂12-Oct-82 1627 JJW
C00183 00069 ∂12-Oct-82 1905 Nilsson at SRI-AI Talk
C00187 00070 ∂12-Oct-82 2123 CLT cleaners
C00188 00071 ∂13-Oct-82 0918 FFL
C00189 00072 ∂13-Oct-82 1126 ullman@Diablo (SuNet) Peter's Bar Mitzvah
C00190 00073 ∂13-Oct-82 1214 LGC Notes for today
C00199 00074 ∂13-Oct-82 1513 JDH incompletes
C00200 00075 ∂13-Oct-82 1544 David Warren <WARREN at SRI-AI> Re: Szeredi note
C00203 00076 ∂13-Oct-82 1737 Andrei Broder <CSD.Broder at SU-SCORE> Next AFLB talks
C00209 00077 ∂13-Oct-82 1742 Lowell Wood <LLW at S1-A> Plans
C00210 00078 ∂13-Oct-82 1744 Andrei Broder <CSD.Broder at SU-SCORE> Next AFLB talks
C00217 00079 ∂13-Oct-82 1801 P. Cheeseman <cheeseman at SRI-AI> Time in Planning talk.
C00219 00080 ∂13-Oct-82 1911 Chappell at SRI-AI FRIDAY'S TINLUNCH
C00221 00081 ∂13-Oct-82 2109 WIEDERHOLD at SUMEX-AIM
C00225 00082 ∂13-Oct-82 2114 WIEDERHOLD at SRI-AI coordinates
C00226 00083 ∂14-Oct-82 0251 Mike Farmwald <PMF at S1-A> Saturday Badging Questions
C00228 00084 ∂14-Oct-82 0905 Betty Scott <CSD.BSCOTT at SU-SCORE>
C00230 00085 ∂14-Oct-82 0911 Paula Bauman <PJB at S1-A> Badge
C00232 00086 ∂14-Oct-82 0916 Nancy Dorio <CSD.DORIO at SU-SCORE> ADDENDUM TO COLLOQUIUM NOTICE WEEK OF OCTOBER 18 - 22, 1982
C00234 00087 ∂14-Oct-82 1022 BrianSmith at PARC-MAXC A Reflective Dialect of PROLOG
C00239 00088 ∂14-Oct-82 1109 Bob Moore <BMOORE at SRI-AI> Re: A Reflective Dialect of PROLOG
C00240 00089 ∂14-Oct-82 1130 FFL
C00241 00090 ∂14-Oct-82 2033 RPG Friday
C00242 00091 ∂15-Oct-82 1105 CLT SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
C00243 00092 ∂15-Oct-82 1300 Lowell Wood <LLW at S1-A> This PM
C00244 00093 ∂15-Oct-82 1331 LGC Meeting
C00245 00094 ∂15-Oct-82 1339 Carolyn Tajnai <CSD.TAJNAI at SU-SCORE> Forum 15th Annual Meeting
C00248 00095 ∂15-Oct-82 1505 FFL
C00249 00096 ∂15-Oct-82 1536 Andrei Broder <CSD.Broder at SU-SCORE> Speaker(s) needed
C00250 00097 ∂15-Oct-82 1549 FFL
C00251 00098 ∂15-Oct-82 2126 CLT MTC and FORMAL SYSTEMS SEMINAR
C00254 00099 ∂17-Oct-82 1255 Gene Golub <CSD.GOLUB at SU-SCORE> Reception
C00255 00100 ∂18-Oct-82 1051 FFL
C00256 00101 ∂18-Oct-82 1134 Tom Wadlow <TAW at S1-A>
C00258 00102 ∂18-Oct-82 1138 Gene Golub <CSD.GOLUB at SU-SCORE> lunch on Tuesday
C00259 00103 ∂18-Oct-82 1147 FFL
C00260 00104 ∂18-Oct-82 1225 Paul Armer <CSD.ARMER at SU-SCORE> Admissions Committee
C00262 00105 ∂18-Oct-82 1240 BrianSmith at PARC-MAXC Re: A Reflective Dialect of PROLOG
C00264 00106 ∂18-Oct-82 1403 CLT featherbed
C00265 00107 ∂18-Oct-82 1534 LGC Discussion tomorrow at 3pm?
C00271 00108 ∂19-Oct-82 0939 BrianSmith at PARC-MAXC Meeting on Thursday
C00282 00109 ∂19-Oct-82 2321 Gene Golub <CSD.GOLUB at SU-SCORE> Sexism and Racism
C00285 00110 ∂20-Oct-82 0757 Gene Golub <CSD.GOLUB at SU-SCORE>
C00286 00111 ∂20-Oct-82 0900 JMC*
C00287 00112 ∂20-Oct-82 1200 BrianSmith Last Announcement
C00289 00113 ∂20-Oct-82 1543 RPG Budget
C00295 00114 ∂21-Oct-82 0027 JJW 206 homework
C00301 00115 ∂21-Oct-82 0059 ME modem problem?
C00302 00116 ∂21-Oct-82 1012 CLT SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
C00303 00117 There won't be Wiederhold money. We have a budget of 90K which we
C00304 00118 ∂21-Oct-82 1144 FFL Call from Barbara Hodges, Portland, 503 224 5505
C00305 00119 ∂21-Oct-82 1152 FFL
C00306 00120 ∂21-Oct-82 1422 Gene Golub <CSD.GOLUB at SU-SCORE> Absence
C00307 00121 ∂21-Oct-82 2229 Gene Golub <CSD.GOLUB at SU-SCORE> [Don Knuth <DEK at SU-AI>: space concerns]
C00313 00122 ∂22-Oct-82 0918 Chappell at SRI-AI TODAY'S TINLUNCH
C00315 00123 ∂22-Oct-82 1300 JMC*
C00316 00124 ∂22-Oct-82 1550 Andrei Broder <CSD.Broder at SU-SCORE> Next AFLB talks
C00319 00125 ∂22-Oct-82 1626 CLT MTC and FORMAL SYSTEMS SEMINAR
C00321 00126 ∂23-Oct-82 1311 Jon Abbis <CSD.ABBIS at SU-SCORE> Advanced Phd Students for Annual Report
C00322 00127 ∂23-Oct-82 1537 KAHN at USC-ISI Re: Wiederhold
C00323 00128 ∂23-Oct-82 1723 JJW 206 homework
C00326 00129 ∂25-Oct-82 0922 OHLANDER at USC-ISI Common Lisp Support
C00330 00130 ∂25-Oct-82 1010 FFL
C00331 00131 ∂25-Oct-82 1150 RPG ARPA
C00332 00132 ∂25-Oct-82 1810 BUCHANAN at SUMEX-AIM reprinting SAIL Memos
C00334 00133 ∂25-Oct-82 1937 Paul Armer <CSD.ARMER at SU-SCORE> Tuesday Luncheon
C00335 00134 ∂26-Oct-82 0832 FFL
C00336 00135 ∂26-Oct-82 0944 Woody Bledsoe <ATP.Bledsoe at UTEXAS-20> Schedule at the AMS meeting.
C00341 00136 ∂26-Oct-82 1052 MLB Symbolics Lisp manuals
C00343 00137 ∂26-Oct-82 1158 Nancy Dorio <CSD.DORIO at SU-SCORE> COLLOQUIUM NOTICE WEEK OF NOVEMBER 1 - 5, 1982
C00346 00138 ∂26-Oct-82 1435 FFL
C00347 00139 ∂26-Oct-82 2031 CLT
C00348 00140 ∂27-Oct-82 1152 FFL
C00349 00141 ∂27-Oct-82 1442 RPG Adams
C00350 00142 ∂27-Oct-82 1447 RPG If
C00351 00143 ∂28-Oct-82 0435 ADAMS at USC-ISI
C00352 00144 ∂28-Oct-82 1008 Chappell at SRI-AI FRIDAY'S TINLUNCH
C00354 00145 ∂28-Oct-82 1156 Navarro at SRI-AI FUTURE TALKS
C00355 00146 ∂28-Oct-82 1420 CL.BOYER at UTEXAS-20 Publication of LISP Conference Proceedings
C00356 00147 ∂29-Oct-82 0955 Woody Bledsoe <ATP.Bledsoe at UTEXAS-20> Program for Denver Meeting
C00375 00148 ∂29-Oct-82 1331 Nancy Dorio <CSD.DORIO at SU-SCORE> CORRECTION TO COLLOQUIUM NOTICE WEEK OF NOVEMBER 1 - 5, 1982
C00377 00149 ∂29-Oct-82 1400 CSCHMIDT at SUMEX-AIM Chaosnet is coming Monday!
C00379 00150 ∂29-Oct-82 1443 JK
C00382 00151 ∂30-Oct-82 1308 Betty Scott <CSD.BSCOTT at SU-SCORE> Secretary
C00385 00152 ∂30-Oct-82 1621 Gene Golub <CSD.GOLUB at SU-SCORE> Lunch on Tuesday
C00386 00153 ∂30-Oct-82 1622 Gene Golub <CSD.GOLUB at SU-SCORE> Tenured Faculty Meeting
C00387 00154 ∂31-Oct-82 1124 Feigenbaum at SUMEX-AIM CMU/IBM workstation plan (retransmission)
C00399 00155 ∂31-Oct-82 1758 KAHN at USC-ISI Re: CMU/IBM workstation plan (retransmission)
C00402 00156 ∂01-Nov-82 0957 Bob Moore <BMOORE at SRI-AI> Talk on Comparatives
C00403 00157 ∂01-Nov-82 2033 Feigenbaum at SUMEX-AIM visit by Alpha-Omega Steering group
C00405 00158 ∂01-Nov-82 2031 Andrei Broder <CSD.Broder at SU-SCORE> Next AFLB talks
C00409 00159 ∂02-Nov-82 1019 KAHN at USC-ISI comments on balzer msg??
C00418 00160 ∂02-Nov-82 1045 CSCHMIDT at SUMEX-AIM Chaosnet
C00420 00161 ∂02-Nov-82 1049 JK dd in mj360
C00421 00162 ∂02-Nov-82 1347 BUCHANAN at SUMEX-AIM Re: visit by Alpha-Omega Steering group
C00422 00163 ∂02-Nov-82 1400 Chappell at SRI-AI Doug Lenat's Visit - November 8,1982
C00426 00164 ∂02-Nov-82 1632 Kanerva at SUMEX-AIM TVEDIT with large character set
C00427 00165 ∂02-Nov-82 1657 Marlene Yearwood <CSD.YEARWOOD at SU-SCORE> [The Mailer Daemon <Mailer at SU-SCORE>: Message of 2-Nov-82 16:08:51]
C00429 00166 ∂02-Nov-82 1701 JJW Exam
C00431 00167 ∂02-Nov-82 2342 RPG
C00434 00168 ∂03-Nov-82 0100 RPG
C00435 00169 ∂03-Nov-82 0955 Bob Moore <BMOORE at SRI-AI> Time change for comparatives talk
C00436 00170 ∂03-Nov-82 1131 ML
C00455 00171 ∂03-Nov-82 1310 Gene Golub <GHG at SU-AI> lunches
C00458 00172 ∂03-Nov-82 1523 Chappell at SRI-AI Friday's TINLUNCH
C00460 00173 ∂03-Nov-82 1537 Tom Binford <TOB at SU-AI>
C00462 00174 ∂03-Nov-82 1552 CLT i
C00463 00175 ∂03-Nov-82 1731 P. Cheeseman <cheeseman at SRI-AI> Probabilistic Inference Talk
C00466 00176 ∂03-Nov-82 1752 Gene Golub <CSD.GOLUB at SU-SCORE> Meeting on Thursday, Nov4
C00467 00177 ∂03-Nov-82 1908 Nancy Dorio <CSD.DORIO at SU-SCORE> COLLOQUIUM NOTICE WEEK OF NOVEMBER 8 - 12, 1982
C00471 00178 ∂03-Nov-82 2125 CLT SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
C00476 00179 ∂03-Nov-82 2247 Feigenbaum at SUMEX-AIM retransmission
C00482 00180 ∂04-Nov-82 1124 REITER at RUTGERS reply to your message
C00484 00181 ∂05-Nov-82 0828 Chappell at SRI-AI November 8th Visit
C00490 00182 ∂05-Nov-82 0900 Gene Golub <CSD.GOLUB at SU-SCORE> Our talk and misc
C00492 00183 ∂05-Nov-82 0930 Marlene Yearwood <CSD.YEARWOOD at SU-SCORE> Last Interview
C00494 00184 ∂05-Nov-82 1027 CSCHMIDT at SUMEX-AIM Chaosnet progress report
C00500 00185 ∂05-Nov-82 1055 DCL Lisp history and manuscript
C00501 00186 ∂05-Nov-82 1109 Nancy Dorio <CSD.DORIO at SU-SCORE> pmessage
C00502 00187 ∂05-Nov-82 1204 Carolyn Tajnai <CSD.TAJNAI at SU-SCORE> Forum speakers
C00503 00188 ∂05-Nov-82 1437 Marlene Yearwood <CSD.YEARWOOD at SU-SCORE> Interview on Tuesday
C00506 00189 ∂05-Nov-82 1803 CLT MTC and FORMAL SYSTEMS SEMINAR
C00508 00190 ∂07-Nov-82 0852 CLT
C00509 00191 ∂07-Nov-82 1545 KAHN at USC-ISI
C00511 00192 ∂07-Nov-82 1606 CLT
C00512 00193 ∂08-Nov-82 0939 Gene Golub <CSD.GOLUB at SU-SCORE> Forsythe Lectures
C00517 00194 ∂08-Nov-82 0945 barwise@Uwisc (Jon Barwise) transfinite chess
C00518 00195 ∂08-Nov-82 0956 Gene Golub <CSD.GOLUB at SU-SCORE> Lunch with Lieberman
C00519 00196 ∂08-Nov-82 1005 RPG SL
C00520 00197 ∂08-Nov-82 1002 RPG
C00521 00198 ∂08-Nov-82 1046 JJW EKL manual
C00522 00199 ∂08-Nov-82 1047 JJW Fran's mail
C00523 00200 ∂08-Nov-82 1052 Paul Armer <CSD.ARMER at SU-SCORE> Comp Comm
C00525 00201 ∂08-Nov-82 1311 RPG
C00532 00202 ∂08-Nov-82 1359 CSCHMIDT at SUMEX-AIM Chaosnet progress report
C00534 00203 ∂08-Nov-82 1444 Chappell at SRI-AI William (Bill) Mann's Visit
C00536 00204 ∂08-Nov-82 1526 DCL Lisp History
C00537 00205 ∂08-Nov-82 1555 Paul Armer <CSD.ARMER at SU-SCORE> Dinner with Raj Reddy
C00538 00206 ∂08-Nov-82 2328 HST via SUMEX-AIM lisp history manuscript
C00539 00207 ∂08-Nov-82 2337 Gene Golub <CSD.GOLUB at SU-SCORE> [Calvin Quate <ICL.QUATE at SU-SCORE>: Deanery]
C00547 00208 ∂09-Nov-82 0727 pratt at Navajo statistics (cc)
C00551 00209 ∂09-Nov-82 0729 pratt at Navajo statistics
C00553 00210 ∂09-Nov-82 1003 Nancy Dorio <CSD.DORIO at SU-SCORE> pmessage
C00555 00211 ∂09-Nov-82 1135 Nancy Dorio <CSD.DORIO at SU-SCORE> pmessage
C00556 00212 ∂09-Nov-82 1518 Bolles at SRI-AI CPR Class
C00557 00213 ∂09-Nov-82 1617 Andrei Broder <CSD.Broder at SU-SCORE> Next AFLB talks
C00564 00214 ∂09-Nov-82 1724 Nancy Dorio <CSD.DORIO at SU-SCORE> COLLOQUIUM NOTICE WEEK OF NOVEMBER 15 - 19, 1982
C00568 00215 ∂10-Nov-82 0900 JMC*
C00569 00216 ∂10-Nov-82 1046 ARG my dissertation
C00570 00217 ∂10-Nov-82 1542 Paul Armer <CSD.ARMER at SU-SCORE> Comprehensive Committee
C00571 00218 ∂10-Nov-82 1622 Gene Golub <CSD.GOLUB at SU-SCORE> [John McCarthy <JMC at SU-AI>:]
C00575 00219 ∂10-Nov-82 1620 Andrei Broder <CSD.Broder at SU-SCORE> O.R. Colloquium
C00576 00220 ∂10-Nov-82 1624 Betty Scott <CSD.BSCOTT at SU-SCORE> Maribel Calderon
C00578 00221 ∂10-Nov-82 1712 Betty Scott <CSD.BSCOTT at SU-SCORE> Applicants
C00579 00222 ∂10-Nov-82 2028 Feigenbaum at SUMEX-AIM question re S1 project
C00581 00223 ∂10-Nov-82 2117 Gene Golub <CSD.GOLUB at SU-SCORE> New word
C00582 00224 ∂10-Nov-82 2118 Feigenbaum at SUMEX-AIM (Response to message)
C00583 00225 ∂10-Nov-82 2133 Gene Golub <CSD.GOLUB at SU-SCORE> message from Hastorf
C00584 00226 ∂10-Nov-82 2240 David R. Cheriton <CSL.DRC at SU-SCORE> Modern Tuition Credit technology
C00587 00227 ∂10-Nov-82 2306 Vaughan Pratt <pratt at Navajo> Tom's argument
C00589 00228 ∂11-Nov-82 0123 David R. Cheriton <CSL.DRC at SU-SCORE> Clarification on Tuition Credit Technology
C00591 00229 ∂11-Nov-82 0748 Edward J. McCluskey <CSL.CRC.EJM at SU-SCORE> Re: Modern Tuition Credit technology
C00592 00230 ∂11-Nov-82 1008 Nancy Dorio <CSD.DORIO at SU-SCORE> pmessage
C00593 00231 ∂11-Nov-82 1057 TOB AFOSR internal advisory board meeting
C00595 00232 ∂11-Nov-82 1112 SHOSTAK at SRI-CSL graph colorings and such
C00599 00233 ∂11-Nov-82 1117 ZM schedule
C00602 00234 ∂11-Nov-82 1209 Nancy Dorio <CSD.DORIO at SU-SCORE> it will not go
C00603 00235 ∂11-Nov-82 1324 Paul Armer <CSD.ARMER at SU-SCORE> Committee Assignments
C00609 00236 ∂11-Nov-82 1356 Rita Leibovitz <CSD.rita at SU-SCORE> FOO
C00610 00237 ∂12-Nov-82 0838 Nancy Dorio <CSD.DORIO at SU-SCORE> pmessage
C00616 00238 ∂12-Nov-82 0908 JJW EKL at LOTS
C00618 00239 ∂12-Nov-82 1337 Marlene Yearwood <CSD.YEARWOOD at SU-SCORE> Interviews, etc
C00622 00240 ∂12-Nov-82 2035 LGC
C00623 00241 ∂13-Nov-82 0946 pratt@Navajo (SuNet) Re: distribution list for Admissions committee
C00629 00242 ∂13-Nov-82 1252 JJW 206 Midterms
C00631 00243 ∂13-Nov-82 2027 KMP at MIT-OZ at MIT-MC headerless mail
C00632 00244 ∂14-Nov-82 1525 RPG Scheme
C00633 00245
C00638 00246 ∂14-Nov-82 1934 JJW
C00639 00247 ∂14-Nov-82 2013 RPG Bad, Bad!
C00640 00248 ∂15-Nov-82 0000 ZM Qual
C00641 00249 ∂15-Nov-82 0925 JK
C00642 00250 ∂15-Nov-82 0946 MAS AFOSR/CAMS Meeting
C00643 00251 ∂15-Nov-82 1201 TOB aaup
C00644 00252 ∂16-Nov-82 0856 Nancy Dorio <CSD.DORIO at SU-SCORE> pmessage
C00645 00253 ∂16-Nov-82 1053 Kent M. Pitman <KMP at MIT-MC> followup
C00646 00254 ∂16-Nov-82 1800 Paul Armer <CSD.ARMER at SU-SCORE> Meeting.
C00648 00255 ∂17-Nov-82 0916 Chappell at SRI-AI Carl Hewitt's Visit
C00649 00256 ∂17-Nov-82 0934 Aaai-Office at SUMEX-AIM Your Dues in AAAI
C00651 00257 ∂17-Nov-82 1027 Don Walker <WALKER at SRI-AI> Re: Your Dues in AAAI
C00653 00258 ∂17-Nov-82 1111 Bobrow at PARC-MAXC Review of Dgano and Sirovich
C00654 00259 ∂17-Nov-82 1626 Nancy Dorio <CSD.DORIO at SU-SCORE> pmessage
C00655 00260 ∂17-Nov-82 2256 JK
C00657 00261 ∂18-Nov-82 1546 JK
C00658 00262 ∂18-Nov-82 1723 Feigenbaum at SUMEX-AIM Re: Meeting.
C00660 00263 ∂18-Nov-82 1934 YOM
C00661 00264 ∂18-Nov-82 2248 Gene Golub <CSD.GOLUB at SU-SCORE> Meeting on Space
C00662 00265 ∂19-Nov-82 0900 JMC*
C00663 00266 ∂19-Nov-82 0919 Chappell at SRI-AI TODAY's Talk (TINLUNCH to follow)
C00665 00267 ∂19-Nov-82 0949 Nancy Dorio <CSD.DORIO at SU-SCORE> pmessage
C00666 00268 ∂19-Nov-82 1058 JK
C00670 00269 ∂19-Nov-82 1045 DCL Lisp
C00671 00270 ∂19-Nov-82 1327 JK
C00673 00271 ∂19-Nov-82 1328 RWW prolog
C00674 00272 ∂19-Nov-82 1451 JK
C00677 00273 ∂19-Nov-82 1510 JK flat
C00678 00274 ∂21-Nov-82 1006 JK lispax
C00679 00275 ∂21-Nov-82 1558 CLT
C00680 00276 ∂22-Nov-82 0900 JMC*
C00681 00277 ∂22-Nov-82 1114 Lynn Gotelli <CSD.GOTELLI at SU-SCORE> [John McCarthy <JMC at SU-AI>:]
C00682 00278 ∂22-Nov-82 1128 DCL Stoyan manuscript
C00683 00279 ∂22-Nov-82 1300 JMC*
C00684 00280 ∂23-Nov-82 1203 Paul Armer <CSD.ARMER at SU-SCORE> Meeting with Hastorf et al
C00686 00281 ∂23-Nov-82 1500 JMC*
C00687 00282 ∂24-Nov-82 0000 JMC*
C00688 00283 ∂24-Nov-82 0917 MCCARTY at RUTGERS Business Language
C00690 00284 ∂24-Nov-82 0926 Amy Atkinson <CSD.ATKINSON at SU-SCORE> Chalkboard
C00691 00285 ∂24-Nov-82 1000 JMC*
C00692 00286 ∂24-Nov-82 1042 Nancy Dorio <CSD.DORIO at SU-SCORE> pmessage
C00693 00287 ∂25-Nov-82 2235 TOB
C00698 00288 ∂26-Nov-82 0938 Bobrow at PARC-MAXC Re: refereeing
C00700 00289 ∂26-Nov-82 1559 Bobrow at PARC-MAXC Re: Connection to Brian's work
C00703 00290 ∂27-Nov-82 1322 JJW Defining LISP functions in EKL
C00713 00291 ∂27-Nov-82 1400 JJW More
C00716 00292 ∂29-Nov-82 0856 JJW Minimization schema and functional equations
C00720 00293 ∂29-Nov-82 0900 JMC*
C00721 00294 ∂29-Nov-82 0900 JMC*
C00722 00295 ∂29-Nov-82 1000 JMC*
C00723 00296 ∂29-Nov-82 1042 Bob Moore <BMOORE at SRI-AI> Re: references
C00726 00297 ∂29-Nov-82 1210 JJW Loop example
C00727 00298 ∂29-Nov-82 1342 JJW 206 compiler project
C00728 00299 ∂29-Nov-82 1522 ARG brief meeting
C00729 00300 ∂30-Nov-82 0655 PJH via ROCHESTER haas thesis
C00730 00301 ∂30-Nov-82 0900 JMC*
C00731 00302 ∂30-Nov-82 1057 Bob Moore <BMOORE at SRI-AI>
C00732 00303 ∂01-Dec-82 1921 Andrei Broder <CSD.Broder at SU-SCORE> Course evaluation
C00734 00304 ∂01-Dec-82 2047 BH
C00735 00305 ∂02-Dec-82 0937 Chappell at SRI-AI TINLUNCH ON TOMORROW
C00737 00306 ∂02-Dec-82 1122 Bob Moore <BMOORE at SRI-AI> Haskell Curry
C00738 00307 ∂02-Dec-82 1505 REITER at RUTGERS Circumscription
C00741 00308 ∂02-Dec-82 1617 Paul Armer <CSD.ARMER at SU-SCORE> [Paul Armer <CSD.ARMER at SU-SCORE>: Meeting with Hastorf et al]
C00743 00309 ∂02-Dec-82 2145 ARG reminder
C00744 00310 ∂03-Dec-82 1452 RPG
C00746 00311 ∂04-Dec-82 1549 CLT
C00747 00312 ∂04-Dec-82 1900 JDH
C00748 00313 ∂05-Dec-82 0127 ME cool, man, real hot
C00749 00314 ∂05-Dec-82 1644 Feigenbaum at SUMEX-AIM TIME FOR CS229 TOPICS IN AI COURSE
C00751 00315 ∂06-Dec-82 0829 Darden at SUMEX-AIM experimental epistemology
C00753 00316 ∂07-Dec-82 1215 Darden at SUMEX-AIM how things are
C00755 00317 ∂07-Dec-82 1225 REITER at RUTGERS circumscription
C00761 00318 ∂08-Dec-82 2240 Lowell Wood <LLW at S1-A> Hear Ye! Hear Ye!
C00763 00319 ∂08-Dec-82 2252 WIEDERHOLD at SUMEX-AIM Re: Hear Ye! Hear Ye!
C00764 00320 ∂09-Dec-82 0845 BUCHANAN at SUMEX-AIM Re: experimental epistemology
C00766 00321 ∂09-Dec-82 0920 JJW 206
C00767 00322 ∂09-Dec-82 1339 Jeff Rubin <JBR at S1-A> terminal recommendation
C00769 00323 ∂10-Dec-82 0900 JMC*
C00770 00324 ∂10-Dec-82 1522 Jeff Rubin <JBR at S1-A>
C00771 00325 ∂10-Dec-82 1840 EJG WAITS dialup terminals
C00776 00326 ∂10-Dec-82 2019 IAZ
C00777 00327 ∂11-Dec-82 1718 JJW 206 final
C00778 00328 ∂12-Dec-82 0113 JJW 206 final
C00779 00329 ∂13-Dec-82 1706 TVR MAIL
C00780 00330 ∂13-Dec-82 2225 CSL.CRC.EJM@SU-SCORE (SuNet) Re: tenure
C00781 00331 ∂14-Dec-82 1240 CSD.ARMER@SU-SCORE (SuNet) [The Mailer Daemon <Mailer at SU-SCORE>: Message of 13-Dec-82 11:19:49]
C00785 00332 ∂14-Dec-82 2143 Don Walker <WALKER at SRI-AI> [The Mailer Daemon <Mailer at SRI-AI>: Message of 14-Dec-82 13:55:59]
C00788 00333 ∂14-Dec-82 2252 JJW 206 final
C00789 00334 ∂14-Dec-82 2317 Woody Bledsoe <ATP.Bledsoe at UTEXAS-20> ATP Session in Denver
C00797 00335 ∂15-Dec-82 0804 MDD via NYU
C00799 00336 ∂15-Dec-82 1414 CSD.BSCOTT@SU-SCORE (SuNet) [MCKENNEY at USC-ISI: Re: AO 4582]
C00802 00337 ∂15-Dec-82 1933 Robert C. Berwick <BERWICK at MIT-MC>
C00803 00338 ∂01-Jan-83 0001 JMC*
C00804 00339 ∂16-Dec-82 1202 Edward C. Pattermann <PATTERMANN at SUMEX-AIM>
C00808 00340 ∂17-Dec-82 1400 JMC*
C00809 00341 ∂17-Dec-82 2300 JMC*
C00810 00342 ∂18-Dec-82 1814 JK new ekl
C00811 00343 ∂18-Dec-82 1819 JK
C00812 00344 ∂18-Dec-82 1823 JK new ekl
C00813 00345 ∂19-Dec-82 1231 JJW 206
C00814 00346 ∂20-Dec-82 2242 RPG Arpa proposal
C00817 00347 ∂20-Dec-82 2252 RPG Ok
C00818 00348 ∂21-Dec-82 0900 JMC*
C00819 00349 ∂21-Dec-82 2010 TOB industrial professor
C00824 00350 ∂22-Dec-82 0041 100 on TTY161 0041: pourne@mc via USC-TAC
C00826 ENDMK
C⊗;
∂01-Oct-82 1717 Kent M. Pitman <KMP at MIT-MC>
Date: 1 October 1982 20:16-EDT
From: Kent M. Pitman <KMP at MIT-MC>
To: JMC at SU-AI
Date: 01 Oct 1982 1645-PDT
From: John McCarthy <JMC at SU-AI>
Are you connected to T sufficiently to have me sent material concerning it.
I'm now actively thinking about new features for Lisp and the correction
of anomalies.
-----
My involvement in T took place primarily during summer '81 when I worked with
Jonathan Rees on the initial language spec. I continue to be involved heavily
in design discussions but am no longer in direct contact with documentation or
sources. I'll forward your request for info to Jonathan Rees, who I'm sure will
be able to get you the information you seek. Feel free to send me mail on any
questions you have about the language. I have a strong interest in Lisp design.
The others, too, would welcome questions, too.
The design group is
Jonathan Rees (Rees@YALE)
Norman Adams (Adams@YALE)
Kent Pitman (KMP@MC)
∂01-Oct-82 1801 Paul Armer <CSD.ARMER at SU-SCORE> Re: Visit of Barbara Liskov
Date: 1 Oct 1982 1205-PDT
From: Paul Armer <CSD.ARMER at SU-SCORE>
Subject: Re: Visit of Barbara Liskov
To: CSD.IRMGILD at SU-SCORE, faculty at SU-SCORE
Stanford-Phone: (415) 497-2906
In-Reply-To: Your message of 30-Sep-82 1612-PDT
I'd like to join the Barabara Liskov lunch. When is it? and Where?
Paul
-------
∂01-Oct-82 1807 Gene Golub <CSD.GOLUB at SU-SCORE> Barbara Liskov's Visit
Date: 1 Oct 1982 1507-PDT
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: Barbara Liskov's Visit
To: faculty at SU-SCORE
I'm afraid we weren't explicit enough about Barbara Liskov's visit.
She will be spending the day here on Tuesday, October 12 and give
the colloquium that afternoon. Since she will be here on a Tuesday
she will be attending our general faculty lunch. The reason the
faculty lunch was scheduled on Tuesday was that we would have an
easy mechanism to meet our out of town visitors.
On the evening of Oct 12 there will be a Chinese banquet at 7:30 PM.
The cost will be in total $12.50 per person for the entire meal.
Anyone who wishes to come is invited.
1) Please let Irmgild know if you wish to see Liskov. Give specific
times.
2) Let Irmgild know if you wish to have dinner. How many? The specific
place has not been chosen.
GENE
-------
∂01-Oct-82 1913 BUG-CKSUM problems with enormous files
Sender: Woods at PARC-MAXC
Date: 1-Oct-82 19:12:07 PDT (Friday)
From: BUG-CKSUM
Subject: problems with enormous files
To: JMC at SAIL
cc: ME at SAIL
Due to the way CKSUM works, it is unable to handle files larger than about 102
disk blocks. The SAIL compiler compounds the problem by failing to provide
graceful error recovery if an attempt is made to allocate more memory than
exists.
Fixing this problem would require substantive changes to CKSUM and so is
unlikely to occur in the near future. A quick fix could be provided to make
CKSUM ignore all but the first 100 disk blocks of any single file.
-- Don.
Thanks for the prompt reply. The solution is to split the file.
The common lisp file seems to be breaking checksum, and the problem is
unlikely to be fixed. I suggest splitting the file.
∂01-Oct-82 1922 Allen.Newell at CMU-10A Re: Historical note: physical symbol systems
Date: 1 October 1982 2223-EDT (Friday)
From: Allen.Newell at CMU-10A
To: Edward Feigenbaum <CSD.FEIGENBAUM at SU-SCORE>
Subject: Re: Historical note: physical symbol systems
CC: Allen.Newell at CMU-10A, Herb.Simon at CMU-10A, minsky at MIT-AI,
jmc at SU-AI, dek at SU-AI
In-Reply-To: Edward Feigenbaum's message of 1 Oct 82 19:32-EST
Message-Id: <01Oct82 222313 AN02@CMU-10A>
Ed: The quote is very interesting and it suggests that Ada Lovelace was
certainly aware of the special powers of the Analytical Engine. It does
not permit a discrimination between which of the several ways to look
at such systems she held -- universal computation, the stored-program
principle, symbols systems, or just some sense of the ability to have
abstractions (which no one has yet quite turned into a principle in which
can be seen the power of such systems). Unfortuneately, the use of
symbols occurs often without any regard to the ability of such symbols
to designate (ie, to access other information), eg, the symbols on a
Turing tape which are clearly function as just data. So the use of the
term "symbol" is usually pretty ambiguous. AN
∂01-Oct-82 2024 RPG
Common.msg => Common.1+Common.msg In general
Common.1+Common.2...Common.n+Common.msg will be the history.
-rpg-
∂01-Oct-82 2139 Gene Golub <CSD.GOLUB at SU-SCORE> Re: industry professorship
Date: 1 Oct 1982 2133-PDT
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: Re: industry professorship
To: JMC at SU-AI
In-Reply-To: Your message of 1-Oct-82 1657-PDT
this seems like a good idea. i'll try to think up another name.
GENE
-------
∂01-Oct-82 2147 Gene Golub <CSD.GOLUB at SU-SCORE> Titles
Date: 1 Oct 1982 2143-PDT
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: Titles
To: faculty at SU-SCORE
John McCarthy wonders whether there is a better title than "Industrial
Professor". Any comments? GENE
-------
∂02-Oct-82 0854 Gene Golub <CSD.GOLUB at SU-SCORE> [Art Samuel <ALS at SU-AI>: Titles ]
Date: 2 Oct 1982 0848-PDT
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: [Art Samuel <ALS at SU-AI>: Titles ]
To: jmc at SU-AI
Mail-from: ARPANET site SU-AI rcvd at 2-Oct-82 0712-PDT
Date: 02 Oct 1982 0715-PDT
From: Art Samuel <ALS at SU-AI>
Subject: Titles
To: csd.golub at SU-SCORE
When I held such a post at MIT, I was called a Visiting Professor.
-------
∂02-Oct-82 1109 CLT if
you are going out let me know. i found out where to
get a new lint trap for the clothes dryer. perhaps
you could pick it up.
∂02-Oct-82 1146 CLT ps
the comforter cover is ready
∂02-Oct-82 1158 JJW Class videotapes
One of the students asked on Thursday whether the class was being taped.
I asked Marilynn about this, and got the following reply:
∂02-Oct-82 1155 Marilynn Walker <CSD.MWALKER at SU-SCORE> Re: Class videotapes
Date: 2 Oct 1982 1151-PDT
From: Marilynn Walker <CSD.MWALKER at SU-SCORE>
Subject: Re: Class videotapes
To: JJW at SU-AI
In-Reply-To: Your message of 1-Oct-82 1156-PDT
All TV courses w/be taped during the first week of class. If there is a
great need for the course to be videotaped for the entire qtr, I need to
hear from the instructor. The only reason we approve classes be taped is
if there is a great time conflict w/the students. It is not meant to be
used solely for allowing students to miss class knowing they can see it
later on tape. The library is really making it known to us they have a
problem w/so many students wanting to use the tapes and not enough space
or machines.
I will be sending TV a list by Tuesday which classes will remain on tape
for the entire qtr.
Marilynn
-------
∂02-Oct-82 1227 CLT MTC and FORMAL REASONING SEMINAR
To: "@MTC.DIS[1,CLT]" at SU-AI
TIME: Weds. October 6, 12noon to 1pm +
PLACE: Rm 252 Margaret Jacks Hall
SPEAKER: Richard Waldinger,
SRI
informal title: the sex-life of the subexpressions
informal abstract:
To facilitate inferences involving certain commonly
recurring relations, we define a notion of the "sexuality"
of a subexpression of a given relation. ( A subexpression
may be male, female, both, or neither). In terms of this
notion, we define two rules of inference which shorten
proofs and prune search spaces.
These rules generalize the rules of paramodulation
and E-resolution to relations other than equality and
applies them in a nonclausal setting, in which the
theorem need not be put into conjunctive normal form.
They are of particular advantage in dealing with
transitve relations.
The new rules have been applied to program synthesis
problems.
COMING ATTRACTIONS:
Wednesday October 13, Ben Mozkowski,Stanford
Wednesday October 20 open
Wednesday October 28 David Plaisted,SRI
∂02-Oct-82 1736 Andrei Broder <CSD.Broder at SU-SCORE> Next AFLB talks
Date: 2 Oct 1982 1635-PDT
From: Andrei Broder <CSD.Broder at SU-SCORE>
Subject: Next AFLB talks
To: aflb.all at SU-SCORE
cc: csd.dorio at SU-SCORE
Stanford-Office: MJH 325, Tel. (415) 497-1787
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Note: Andrei Broder is the new AFLB coordinator. All files related to
AFLB have kept their old names but have migrated from
[score]<csd.mayr> to [score]<csd.broder>. The symbolic adresses
remain the same:
AFLB.ALL@score - everybody
AFLB.LOCAL@score - AFLB people in Palo Alto area
AFLB.SU@score - Stanford AFLBunchers.
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
T H E N E X T A F L B - T A L Ks
10/7/82 Don Knuth (Stanford):
"On optimum caching"
A cache memory that is maintained clairvoyantly, i.e., with perfect
knowledge of the future, can be surprisingly effective even when it is
applied to completely random data. It is shown that a cache of size h,
applied optimally to a uniformly random sequence on an alphabet of
size d, is able to avoid faults with probability nearly sqrt(2h/d),
when h is small compared to d. The analysis of this question involves
several subproblems that are of interest in themselves.
******** Time and place: Oct. 7, 12:30pm in MJ352 (Bldg. 460) ********
10/14/82 Andrei Broder (Stanford):
A general expression for Abelian identities
The sums of the type
====
\ p+k n-k+q
A (x, y, p, q) = > binomial(n, k) (x + k) (y + n - k)
n /
====
k
were called ``Abelian binomial sums'' by Riordan. With this notation,
the famous Abel identity can be written
-1 n
A (x, y, -1, 0) := x (x + y + n)
n
and the Cauchy formula becomes
====
\ n-k
A (x, y, 0, 0) = > k! binomial(n, k) (y + x + n)
n /
====
k
Riordan exposed a recurrence and a symmetry formula for A[n] and used
them to iteratively derive similar ``Abelian identities'' for p and q
between -3 and 3. In this presentation, an explicit expression, which
appears to be new, is obtained for the Abelian identities, for all
positive p and q, by counting the number of words associated through
the Foata-Fuchs encoding, to a suitably chosen family of mappings.
This expression involves certain combinatorial entities, named
r-Stirling numbers. Some of the properties of the r-Stirling numbers,
such as their relation to Q-polynomials, will also be discussed.
******** Time and place: Oct. 14, 12:30pm in MJ352 (Bldg. 460) ********
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Regular AFLB meetings are on Thursdays, at 12:30pm, in MJ352 (Bldg.
460).
If you have a topic you would like to talk about in the AFLB seminar
please tell me. (csd.broder@score, MJH325, 497-1787) Contributions
are wanted and welcome. Not all time slots for this year have been
filled so far.
For more information about future AFLB meetings and topics you might
want to look at the file [SCORE]<csd.broder>aflb.bbboard.
-------
∂02-Oct-82 1750 Gene Golub <CSD.GOLUB at SU-SCORE> Gio's Position
Date: 2 Oct 1982 1741-PDT
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: Gio's Position
To: CSD-Faculty: ;
I am sending you a copy of a message Gio sent to his students.
It does not look very hopeful for salvaging his position.
Gio has been of great service to the Department and the students and
he will be missed.
Here is a copy of his message. GENE
--------------------------------------------------------------------
Yesterday afternoon Gene Golub informed that the agreement between the
Medical School and the School of Humanities and Sciences which was
to lead to a long term research appointment has been undone. He
considers that now a further appointment at Stanford is quite unlikely.
Ed Feigenbaum will still be dealing at the Provost's level.
Allthough I still have this year an extension of my assistant professor-
ship I feel I cannot be effective in this situation and have asked Gene
Golub for an immediate leave of absence for this fall quarter.
I count on it being granted.
Students who receive financial support from me should continue to receive
it, but I will not be otherwise available. If Jack Milton is willing to
continue making the arrangements for CS345 it can continue this quarter.
Otherwise we may have to stop after the three speakers to whom
committments have been made have presented their work.
I feel very badly about the students who are working on thesis projects with
me. I know that for some of you this decision is quite damaging, but
any further deferral will not make it better. If you feel you have been
deceived by my statements please consider that I could only work with
the information I received. I don't think you will want to go through
another iteration of this type.
Best wishes to all of you.
Gio
-------
-------
∂03-Oct-82 1421 Gene Golub <CSD.GOLUB at SU-SCORE> Thanks
Date: 3 Oct 1982 1417-PDT
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: Thanks
To: faculty at SU-SCORE
cc: su-bboards at SU-SCORE
Many thanks to the Herriots for graciously inviting over all the new
students these many years. I have always enjoyed meeting the new students
in the relaxed atmosphere at the Herriot's home. This is their last year
for this occaision since Jack is now retired from Stanford.
GENE
-------
∂04-Oct-82 0154 ARK Reiter Articles
A while ago you showed me some articles by Reiter on logical databases. I
don't remember if I made copies, but I can't seem to find them. Could you
(at your convenience) give them to Fran so I can make copies and return
them? I noticed a reference for "Data Bases, a Logical Perspective", in
Proc. Workshop on Data Abstraction Databases and Conceptual Modeling
(Pingree Park, CO), June 1980 that looks like it may be relevant and
interesting. Thanks.
Arthur
∂04-Oct-82 0915 Bob Moore <BMOORE at SRI-AI> Re: industry lectureship
Date: 4 Oct 1982 0913-PDT
From: Bob Moore <BMOORE at SRI-AI>
Subject: Re: industry lectureship
To: JMC at SU-AI
cc: BMOORE at SRI-AI, NILSSON at SRI-AI, GROSZ at SRI-AI, SAGALOWICZ at SRI-AI
In-Reply-To: Your message of 1-Oct-82 1702-PDT
John,
Thanks very much for the information. We are still quite interested, and
I am sure you will be hearing from us about it shortly.
--Bob
-------
∂04-Oct-82 1532 Waldinger at SRI-AI mtc talk at stanford wed.
Date: 4 Oct 1982 1530-PDT
From: Waldinger at SRI-AI
Subject: mtc talk at stanford wed.
To: AIC-Associates:, CSL:
Mail-from: ARPAnet host SU-AI rcvd at 2-Oct-82 1230-PDT
Date: 02 Oct 1982 1227-PDT
From: Carolyn Talcott <CLT at SU-AI>
Subject: MTC and FORMAL REASONING SEMINAR
To: "@MTC.DIS[1,CLT]" at SU-AI
TIME: Weds. October 6, 12noon to 1pm +
PLACE: Rm 252 Margaret Jacks Hall
SPEAKER: Richard Waldinger,
SRI
informal title: the sex-life of the subexpressions
informal abstract:
To facilitate inferences involving certain commonly
recurring relations, we define a notion of the "sexuality"
of a subexpression of a given relation. ( A subexpression
may be male, female, both, or neither). In terms of this
notion, we define two rules of inference which shorten
proofs and prune search spaces.
These rules generalize the rules of paramodulation
and E-resolution to relations other than equality and
applies them in a nonclausal setting, in which the
theorem need not be put into conjunctive normal form.
They are of particular advantage in dealing with
transitve relations.
The new rules have been applied to program synthesis
problems.
COMING ATTRACTIONS:
Wednesday October 13, Ben Mozkowski,Stanford
Wednesday October 20 open
Wednesday October 28 David Plaisted,SRI
-------
∂04-Oct-82 1558 Gene Golub <CSD.GOLUB at SU-SCORE> Reminder
Date: 4 Oct 1982 1551-PDT
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: Reminder
To: faculty at SU-SCORE
Just a reminder that the first faculty lunch will take place
this Tuesday in the Youth Center Conference Room. I have an official
engagement so that I won't be there. Jeff Ullman will be in the chair.
GENE
-------
∂04-Oct-82 1608 Ernst W. Mayr <CSD.MAYR at SU-SCORE> CS Colloquium
Date: 4 Oct 1982 1603-PDT
From: Ernst W. Mayr <CSD.MAYR at SU-SCORE>
Subject: CS Colloquium
To: csd.faculty at SU-SCORE
The first speaker of the CS Colloquium series this fall will be
Richard Watson from LLL. He will try to be here in time for the
Faculty lunch.
If anybody wants to talk to him after that (and before the Colloquium
at 4:15) please send me a message.
-Ernst
-------
∂04-Oct-82 2124 UCBVAX.decvax!watmath!cbostrum@Berkeley Query on "First Order Theories of Ind. Concepts and Props."
Date: Mon Oct 4 10:06:31 1982
From: UCBVAX.decvax!watmath!cbostrum@Berkeley
Subject: Query on "First Order Theories of Ind. Concepts and Props."
Message-Id: <8209050414.27186@UCBVAX.BERKELEY.ARPA>
Received: by UCBVAX.BERKELEY.ARPA (3.207 [9/26/82])
id A27186; 4-Oct-82 21:14:40-PDT (Mon)
To: decvax↑ucbvax↑JMC@SU-AI
I have been reading your paper "First Order Theories of Concepts and
Propositions", from MI9, and it seems to be very good.
The list of Quine, Carnap, Kaplan etc. references will take AI people
very quickly into the heart of the philosophical discussion on this
issue.
There is one thing I am confused about. At the end of the paper you give
a sentence of the form "A knows that B knows what C last asserted",
and say that your formalism cannot express all readings of this sentence.
What disturbs me is that I cant even *see* more than one reading for the
sentence. Could you list the more than one readings that exist?
The only possibility I can see is that one might want to take
"B knows what C last asserted" as ambiguous in the same way
"B knows what C knows" is ambiguous. For the latter sentence, it could
mean that C knows (that) some proposition X, and B knows (that) X too
(reading 1) or it could mean that B knows which proposition it is that
C knows (reading 2).
Reading 2 is possible for the former sentence, but reading 1 seems very
strained; I dont think anyone uses this meaning normally, if at all.
If you cannot answer this right away, could you please acknowledge that
you received this mail message. This is only the second time I have tried
to get to arpa from uucp, and the first time to SU-AI.
Thank you for your trouble.
∂05-Oct-82 0839 JJW Lisp Machine Manuals
I talked to MLB by phone this morning, and he said that he will try to
order some manuals for us. They only have about 10 in the Palo Alto
office right now. He wasn't sure if the price is $12.00 or $20.00, but
there might be an "educational discount".
∂05-Oct-82 1049 BUCHANAN at SUMEX-AIM Comtex Scientific reprints
Date: 5 Oct 1982 1047-PDT
From: BUCHANAN at SUMEX-AIM
Subject: Comtex Scientific reprints
To: jmc at SU-AI
John,
I spoke with the senior editor at Comtex and relayed your agreement
to have the AI Lab reports reprinted. He now needs to get hard copies
of all 325 of them. Do you have a complete set, or would Les Earnest?
I am about to check the CS library.
I also inquired about Comtex offering free online search service to
the CS library in return for this favor, as you suggested, and this fellow
seemed quite agreeable.
The next issue of the AI Magazine will contain Marvin Minsky's introduction
to the Comtex reprints of the MIT AI Lab reports. I believe you will be
asked to consider writing a similar introduction to the SAIL reports.
thanks,
bgb
-------
∂05-Oct-82 1116 LGC Today's meeting with LGC and RPG
Is 3pm a good time for our meeting today? -- Lew
3pm is ok.
∂05-Oct-82 1603 ullman@Diablo (SuNet)
Date: 5 October 1982 16:01:07-PDT (Tuesday)
From: ullman at Diablo
To: jmc at sail, pratt at navajo, zm at sail
Here is my proposal for the MTC QUAL. I divided the world
into a basic part that everyone takes and advanced sections
that will be optional, with examinees taking n out of 8. I
presume that the basic part will be relatively stable, but
that we might add and delete advanced options as fashions
change, e.g., we might like something on theory of distri-
buted computing or cryptocomplexity even now. In each case,
I expect the reading list for the advanced sections will be
supplemented by papers. Forgive me if I am not up on the
proper references in all these areas; I think the intent
will be obvious in each area.
_λB_λa_λs_λi_λc _λP_λa_λr_λt
1. Automata Theory: Hopcroft and Ullman 1-6, 9. Chomsky
hierarchy, PDA's.
2. Computational Complexity: Garey and Johnson. NP-
completeness.
3. Turing Machines and Recursive Function Theory: Manna 1,
Lewis and Papadimitriou 4-6. Undecidability, Turing
machine variants, PCP.
4. Logic: Manna 2, Lewis and Papadimitriou 8-9. Proposi-
tional and predicate calculus.
5. Program Verification: Manna 3-4. Assertions, flowchart
schemes.
_λO_λp_λt_λi_λo_λn_λs
1. Automata Theory: Hopcroft and Ullman 10-11. Closure
properties, deterministic and LR languages.
2. Computational Complexity: Hopcroft and Ullman 12-13.
Time and space complexity, speedup etc., provably
intractable problems, hierarchies, alternation,
random-complete problems.
3. Recursive Function Theory: Rogers.
4. Logic: Kleene, Enderton, and/or Kowalski's book(s).
5. Verification: Boyer and Moore, McCarthy and Talcott,
Manna and Waldinger(?).
6. Denotational Semantics: Scott, Stoy, Manna 5, key
papers(?).
7. Database Theory: Ullman 5, 7, Maier, papers. Applica-
tions of logic to relational query languages, data
dependencies, and relational database design.
8. Dynamic Logic: Pratt, Harel, Pnueli, Owicki, other
papers(?).
∂05-Oct-82 1742 pratt@Navajo (SuNet)
Date: Tuesday, 5 Oct 1982 17:42-PDT
To: ullman at Diablo
Cc: jmc at Sail, pratt at Navajo, zm at Sail
In-reply-to: Your message of 5 October 1982 16:01:07-PDT (Tuesday).
From: Vaughan Pratt <pratt at Navajo>
The options idea is interesting. By including every professor's research
area(s) in the list of options it provides a student with a way of persuading
a professor that (s)he knows the professor's area well enough to be accepted
for research in that area.
The recursion theory option doesn't fit this mold. Still, it seems like a
worthy option.
-v
∂05-Oct-82 2038 ullman@Diablo (SuNet) MTC
Date: 5 October 1982 20:35:05-PDT (Tuesday)
From: ullman at Diablo
Subject: MTC
To: pratt at Navajo
Cc: jmc at Sail, zm at Sail
I didn't intend that the options would all be exactly in the research
area of a prof., but that there would be enough of them that a student
with any reasonable profile of expertise would be able to satisfy the
requirements. However, your view represents another valid approach:
one option, not including the ``basic areas.''
∂06-Oct-82 0741 Navarro at SRI-AI FYI
Date: 6 Oct 1982 0739-PDT
From: Navarro at SRI-AI
Subject: FYI
To: AIC-Associates:
Mail-from: ARPAnet host SRI-CSL rcvd at 4-Oct-82 1423-PDT
Date: 4 Oct 1982 1418-PDT
From: DBERSON at SRI-CSL
Subject: Talk on 7 October 1982
To: navarro at SRI-AI
cc: plaisted at SRI-CSL
Georgia, could you please distribute this message to AI-Associates on
the 2060. Thanks.
Dr. David Plaisted on leave from the University of Illinois will give
a talk at SRI International in the Computer Science Lab on
7 October 1982 at 2 PM in EL381.
Title: A Decision Procedure for Propositional Temporal Logic
Abstract: A decision procedure for discrete linear time propositional
temporal logic has recently been found and implemented. This procedure
not only tells if a formula is valid, but if not, gives minimal conditions
on the time-independent part of the theory for the formula to be valid.
Thus this decision procedure can be used together with specialized
decision procedures for various theories. The procedure makes use of
alternate computation of greatest and least fixed points of equations.
The procedure can be modified to produce a proof that can be checked by
a simple proof checker. We will make some comments about program
verification in general and the role simple proof checkers should have in
program verification.
-------
Dorothy Berson from the Computer Science Lab asked me to pass on this
message. Georgia
-------
∂06-Oct-82 0900 JMC*
Call Kahn about seeing him Friday.
∂06-Oct-82 1028 Nancy Dorio <CSD.DORIO at SU-SCORE> COLLOQUIUM NOTICE WEEK OF OCTOBER 11 - 15, 1982
Date: 6 Oct 1982 0902-PDT
From: Nancy Dorio <CSD.DORIO at SU-SCORE>
Subject: COLLOQUIUM NOTICE WEEK OF OCTOBER 11 - 15, 1982
To: colloq: ;
Stanford-Phone: (415) 497-2273
Date Place Person
Day Event From
Time Title
-------------------------------------------------------------------------------
10/11/82 Math 380C Gerald Hedstrom
Monday Numerical Analysis Lawrence Livermore Laboratory
4:15 p.m. Seminar ``The Use of the Computer in the Asymptotic
Expansions of Integrals''
10/12/82 MJ352 Dr. Bob Blum
Tuesday Medical Technology Stanford University
2:30 p.m. Research Seminar ``Automated Discovery, Confirmation, and
Incorporation of Causal Relationships from a
Large Time Oriented Clinical Database: The RX
Project''
10/12/82 Jordan 040 Barbara Liskov
Tuesday Computer Science MIT Laboratory
4:15 p.m. Colloquium ``Argus: Linguistic Support for Distributed
Computing''
10/13/82 MJ252 Ben Moszkowski
Wednesday MTC \&\ FORMAL Stanford University
12 p.m. SYSTEMS Seminar ``A Temporal Logic for Multi-Level Reasoning
about Hardware''
10/13/82 Terman 153 Professor Werner Trattnig
Wednesday Computer Systems Stanford University
4:15 p.m. Laboratory Seminar To be Announced
10/14/82 MJ352 Andrei Broder
Thursday AFLB Stanford University
12:30 p.m. ``A General Expression for Abelian Identities''
10/15/82 MJ352 Max Layard & Ron Code
Friday Database Research Information Analysis Associates,Palo Alto
3:15 p.m. Seminar ``MEDLOG: A Clinical Database Research Management
System''
-------
∂06-Oct-82 1034 Chappell at SRI-AI TINLUNCH ON FRIDAY
Date: 6 Oct 1982 1033-PDT
From: Chappell at SRI-AI
Subject: TINLUNCH ON FRIDAY
To: TINlunchers:
cc: chappell
From: Kurt Konolige
The TINLUNCH will be held on Friday (this week only), October 8, 1982
in room EK242 at lunchtime. The paper that will be discussed is
CIRCUMSCRIPTION IMPLIES PREDICATE COMPLETION (SOMETIMES)
by
Raymond Reiter
The author will not be present. Copies of this week's presentation
are on Elsie Chappell's file cabinet (EJ251). This paper can also be
found in AAAI-82 PROCEEDINGS OF THE NATIONAL CONFERENCE ON ARTIFICIAL
INTELLIGENCE, pages 418-420. Robert Moore will be presenting next
week's TINLUNCH on Thursday, October 14 at lunchtime.
-------
∂06-Oct-82 1149 Gene Golub <CSD.GOLUB at SU-SCORE> Reminder
Date: 6 Oct 1982 1145-PDT
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: Reminder
To: CSD-Tenured-Faculty: ;
Just a reminder that we will have a faculty meeting at 2:30 on
Thursday. GENE
-------
∂06-Oct-82 1342 CSCHMIDT at SUMEX-AIM New display location
Date: 6 Oct 1982 1337-PDT
From: CSCHMIDT at SUMEX-AIM
Subject: New display location
To: HPP-Lisp-Machines at SUMEX-AIM
The LM-2 displays have been moved to MJH 243 (second floor, next to
the ladies' room). This is also known as the old RPT0 room.
Be wary that the table in use (for the time being) is a little too
narrow for the displays. The monitor rests on the keyboard cable, so don't
don't try to move any of the equipment as you may damage the cable.
--Christopher
-------
∂06-Oct-82 1350 CSCHMIDT at SUMEX-AIM this mailing list
Date: 6 Oct 1982 1344-PDT
From: CSCHMIDT at SUMEX-AIM
Subject: this mailing list
To: HPP-Lisp-Machines at SUMEX-AIM
Please use this mailing list (HPP-Lisp-Machines@SUMEX-AIM) for
communications of general interest pertaining to Symbolics machines. An
archive of traffic is automatically compiled in
{SUMEX-AIM}<DOLPHIN>HPP-Lisp-Machines.ARCHIVE. The location of this archive
will change at some time in the future, and will be announced in this spot.
This mailing list (a copy of which can be found in
{SUMEX-AIM}<DOLPHIN>HPP-Lisp-Machines.DIS) is far from definitive, so please
send mail to me to offer additions and corrections. Should someone you know
be on this list that isn't? The list as of this moment contains:
"HPP-LISP-machines":-
! Diablo users ! -
lark@diablo,-
grinberg@diablo,-
jjf@diablo,-
! SUMEX users ! -
clancey@sumex,-
cschmidt@sumex,-
friedland@sumex,-
london@sumex,-
patterman@sumex
rindfleisch@sumex,-
spurgeon@sumex,-
warner@sumex,-
white@sumex,-
yeager@sumex,-
! SAIL users ! -
rdg@sail,-
JMC@sail,-
RPG@sail,-
! Score users ! -
csd.bach@SU-SCORE,-
csd.barnes@SU-SCORE,-
csd.barr@SU-SCORE,-
csd.brooks@SU-SCORE,-
csd.cpp@SU-SCORE,-
csd.dietterich@SU-SCORE,-
csd.foyster@SU-SCORE,-
csd.freeman@SU-SCORE,-
csd.jock@SU-SCORE,-
csd.langlotz@SU-SCORE,-
csd.novak@SU-SCORE,-
csd.rjoyce@SU-SCORE,-
csd.rosenschein@SU-SCORE,-
csd.smith@SU-SCORE,-
csd.tsuji@SU-SCORE,-
! File store for messages ! -
*<DOLPHIN>HPP-LISP-MACHINES.ARCHIVE
Thank-you,
--Christopher
-------
∂06-Oct-82 1405 CSCHMIDT at SUMEX-AIM LM-2
Date: 6 Oct 1982 1403-PDT
From: CSCHMIDT at SUMEX-AIM
Subject: LM-2
To: JMC at SU-AI
cc: CSchmidt at SUMEX-AIM
Please let me apologize again for omitting your name from the
mailing list. I got the list from Jay Lark, and failed to check it over
because I was sure he had a much better idea of who should be on the list than
I did. I even left Jay off because he wasn't on his own list!
The "crash log" is there because Marc LeBrun (of Symbolics) requested
a log of the crashes. I intend that the archive of HPP-Lisp-Machines
(mailing list) traffic be the log of such events as the display relocation.
I could add a page to that clipboard for such items, if you request it though.
I chose the name HPP-Lisp-Machines for the mailing list name for the
sake of analogy with the name of the dolphin mailing list HPP-Dolphins. The
dolphins are used by non-HPP people as well, but I thought it less confusing
if we didn't go changing the names of mailing lists. I could make pseudonyums,
but I've refrained for fear that people would think that there were two
different mailing lists.
Please send me any ideas or suggestions for making the LM-2 more
useful/stable/convenient/whatever.
--Christopher
-------
∂06-Oct-82 2110 CSVAX.ellen@Berkeley Theory Seminars
Mail-from: ARPANET site UCB-C70 rcvd at 6-Oct-82 1722-PDT
Date: 6 Oct 1982 17:19:19-PDT
From: CSVAX.ellen@Berkeley
To: CSD.Broder@SU-SCORE
Subject: Theory Seminars
Remailed-date: 6 Oct 1982 2102-PDT
Remailed-from: Andrei Broder <CSD.Broder at SU-SCORE>
Remailed-to: aflb.su: ;
I'm willing to mail announcement of Berkeley's theory seminar
to any or all of the people on the AFLB distribution list. If you'd
like to be included in our mailing list, please send your net address
to 'ellen at CSVAX.Berkeley'.
Our seminars are usually held on Mondays, in Room 241 Cory Hall,
from 4-5 pm. Afterwards we normally go across the street for some beer
at the Caffe Espresso.
Next Monday's speaker will be Dr. Manfred Warmuth, UCB, and his
topic will be, "The Complexity of the Iterated Shuffle." On Oct. 18
Prof. John Rhodes will be speaking on "New Algebraic Mehods for the
Manipulation of Formal Languages."
Ellen Boyle
∂07-Oct-82 0214 Bill Gosper <RWG at MIT-MC>
Date: 7 October 1982 05:15-EDT
From: Bill Gosper <RWG at MIT-MC>
To: jmc at SU-AI
sure enough, every time you say make-defstructee,
it conses up a new, permanent array. (it doesn't
use resources by default, however.) rms and i
had a similar discussion once about how maybe
multiple values could be optionally named somewhat
the way arguments are. this also recalls one of the
main differences between pdp10 compiled code vs hand
code: in efficient hand code, the ACs get used much
more efficiently for passing stuff around among
subroutines.
∂07-Oct-82 0911 JJW Re: MacLisp summaries
∂05-Oct-82 1856 Dave Touretzky at CMU-10A Re: MacLisp summaries
Date: 5 October 1982 2155-EDT
From: Dave Touretzky at CMU-10A
To: Joe Weening <JJW at SU-AI>
Subject: Re: MacLisp summaries
In-Reply-To: Joe Weening's message of 5 Oct 82 12:59-EST
Joe,
Glad they made it. If you find any bugs or deficiencies in the summaries,
please let me know. I'll be starting work on the 5th edition soon.
-- Dave
∂07-Oct-82 0952 CL.BOYER at UTEXAS-20 Next Lisp Conference
Date: Thursday, 7 October 1982 11:49-CDT
From: CL.BOYER at UTEXAS-20
To: JMC at SU-AI
Subject: Next Lisp Conference
I have decided to have the next LISP conference in Austin on
Monday and Tuesday, August 6 and 7, 1984. That's the same
week as the AAAI meeting in Austin. My change of heart
about the summer heat problem came when I found I could
arrange for decent dormitory style accomodations, meals, and
an excellent theater-style auditorium that seats 420 all
within the same air-conditioned building, the Jester Center
on the UT campus. Jester is a student dormitory that is
only used for conferences in the summer.
The University will handle the applications of people who
want to stay in Jester, where a single, including room and
board, ran about $25/day this summer. One constraint: room
is not available without board; on the other hand, the
cheapest motel room around is over $40. The auditorium is
free, unless we want an audio/visual technician around. We
can get coffee, donuts, and alcohol catered.
Do you have any objections or reservations about this site
and time?
Sounds fine to me. Congratulations on your prompt solution to the
problem, and on your good luck that AAAI was also prompt.
∂07-Oct-82 1053 MLB Symbolics manuals
To: JJW, JMC
CC: MLB
I can get you manuals for $12 to $15 (depends on lots of obscure factors).
They are currently in short supply and are being reprinted. They are due
to come back from the printers (to our S. Cal. office) around Oct 25th.
Until then, I can only get you ten manuals out of our local stock.
Selling them "on consignment" in class is OK.
Do you want to wait for a full shipment or start with ten?
How many total do you want given the price range and schedule?
You can call me anytime at 494-8081, just leave a message giving your
interests if I'm not available.
∂07-Oct-82 1304 Raj.Reddy at CMU-10A Common Lisp Effort
Date: 7 October 1982 1602-EDT (Thursday)
From: Raj.Reddy at CMU-10A
To: Kahn at USC-ISI
Subject: Common Lisp Effort
CC: JMC at SU-AI, Allen.Newell at CMU-10A,
Scott.Fahlman <FAHLMAN at CMU-20C>, Raj.Reddy at CMU-10A
Message-Id: <07Oct82 160207 RR29@CMU-10A>
Dear Bob,
We have had some discussions here about the Common Lisp effort in the wake
of Guy Steele going to Tartan Labs. The following represent our current
views on the subject.
1. CMU is committed to Common Lisp and wants to make sure it is running on
as many different machines as possible, with Decsystem 20, VAXs, PERQs and Lisp
machines being the first 4 systems on which it should be running within the
next year.
2. Guy Steele won't be leaving until about January. By that time he expects
to leave things in a stable state.
3. It would be good to have Stanford active in this area with Dick Gabriel
spending full-time and John McCarthy spending part of his time, along with
one or two graduate students also working on it. We are strongly in favor
of cooperating with such an activity.
4. Scott Fahlman and a number of others at CMU will continue to spend time
but Scott is expected to concentrate on his NETL machine and parallel AI
architectures research as soon as Common Lisp begins to be useable.
5. At some point it would be good to get the manufacturers to take
responsibility for future maintenance of Common Lisp.
In summary, we are strongly in favor of supporting Dick Gabriel and others
at Stanford and we will work closely with them to make sure that the
effort is successful. I am also forwarding a more detailed response from
Scott.
Best,
Raj
- - - - Begin forwarded message - - - -
Mail-From: ARPANET host CMU-20C received by CMU-10A at 29-Sep-82 22:07:13-EDT
Date: Wednesday, 29 September 1982 22:07-EDT
From: Scott E. Fahlman <Fahlman at Cmu-20c>
To: Raj.Reddy at CMU-10A
Cc: Allen.Newell at CMU-10A, fahlman at CMU-20C
Subject: Netmail from Kahn
Raj,
Thanks for passing this along. It is interesting to see how John
McCarthy views all this. My reactions are as follows:
1. I would welcome the increased involvement of McCarthy and Stanford in
the Common Lisp effort. One more tuba on the bandwagon.
2. I would rather have the administrative control of Common Lisp
(maintaining the manual, calling the meetings, maintaining the yellow
pages, etc.) remain in Pittsburgh, where we can be sure of quality
control. But unless we get Gabriel or someone comparable to come here,
I don't see any way to do this in the long run. Guy will stay involved
for awhile, but that will dwindle; I don't want to be the main person in
this effort indefinitely -- a year from now I hope to be spending most
of my cycles buiding a parallel thinking machine; of the people now in
our department, I see nobody else who is both interested and competent
to handle this, and I can't think of anyone we might be able to hire for
this task. So maybe we have to let go and hope for the best. We'll
still have the ability to veto any changes to the language, since we
will control the Spice and Vax implementations.
3. Of the people currently heavily involved in Common Lisp, minus Guy
and me, Gabriel is by far the best person for the task of ongoing
coordination. He has pretty good taste overall, is respected by the
group, and is not snarled up in the MIT/Symbolics/LMI political
hurricane.
4. Of the goals McCarthy suggests, the important one is to maintain the
Common Lisp library and its documentation. There needs to be a center
for this, run by someone with enough stature to reject things that do
not meet the standards. The task of evaluating, cataloging, organizing,
and testing modules submitted for the library is a big one, and I don't
see the manpower to do it here without Guy's help. In addition, there
needs to be a group somewhere that works on library modules that are
needed but that nobody else wants to do. If McCarthy and Gabriel want
to do this, fine. ARPA should fund them for this.
5. I think that by the time Guy gets to Tartan, the Common Lisp manual
will be pretty stable. There should be much less need for "maintaining
the discussion and organizing meetings" and for supplements to the
manual. Guy can probably handle any ongoing administrivia, but if there
is a need for additional meetings or standardization efforts beyond what
Guy wants to do, Gabriel would be a good person to deal with this. This
function would probably not be needed in the next year or so, but might
become useful after that.
6. McCarthy's comment about Guy losing his impartial status is strange.
Tartan will not be doing a Lisp until long after Common Lisp is settled,
if ever, and even then there is little likelihood of any commercial
rivalry developing. Our involvement with DEC and with 3RCC has not
impaired our ability to act as referees. All of the implementations
(except Symbolics/LMI/MIT) occupy separate, non-conflicting niches.
So, while I disagree with a few of McCarthy's points and comments, I
welcome the initiative. I think that Gabriel would handle the administrative
control over Common Lisp in a responsible manner, and that the coordination
process would work better in the long run with his full-time involvement than
with decreasing shares of Guy's time and mine. And without such a center
somewhere, I fear that I would become the default coordinator, which
would really hurt my ability to concentrate on AI.
Feel free to share all or part of this with Bob Kahn, if you think that
would be useful.
-- Scott
- - - - End forwarded message - - - -
∂07-Oct-82 1409 Gene Golub <CSD.GOLUB at SU-SCORE> URGENT
Date: 7 Oct 1982 1405-PDT
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: URGENT
To: faculty at SU-SCORE
The Dean's office needs to know whether you received any outside
honors during this past year. Please respond to me or Irmgild
as soon as possible. GENE
-------
∂07-Oct-82 1513 FFL
To: JMC, FFL
Mr. Kahn called. You can reach him at 408 256 0129 or 408 256 4612.
\
∂07-Oct-82 1517 FFL [Betty Scott <CSD.BSCOTT at SU-SCORE>: Re: Furniture]
To: JMC, FFL
∂06-Oct-82 1503 Amy Atkinson <CSD.ATKINSON at SU-SCORE> [Betty Scott <CSD.BSCOTT at SU-SCORE>: Re: Furniture]
Date: 6 Oct 1982 1458-PDT
From: Amy Atkinson <CSD.ATKINSON at SU-SCORE>
Subject: [Betty Scott <CSD.BSCOTT at SU-SCORE>: Re: Furniture]
To: ffl at SU-AI
Fran, Paul brought Lew Creary by my office yesterday to ask for a terminal
table and two filing cabinets for his new office (302). I asked Betty
who should pay for them, and this is her reply. Thanks.
amy
---------------
Mail-From: CSD.BSCOTT created at 6-Oct-82 13:38:20
Date: 6 Oct 1982 1338-PDT
From: Betty Scott <CSD.BSCOTT at SU-SCORE>
Subject: Re: Furniture
To: CSD.ATKINSON at SU-SCORE
cc: CSD.BSCOTT at SU-SCORE
In-Reply-To: Your message of 5-Oct-82 1103-PDT
John McCarthy should provide these items for Lew Creary. Ask Fran to take
care of it--cost can come from research or unrestricted funds, since the
use of both items will be for research purposes.
Betty
-------
-------
John, do you wish me to order two cabinets and a table for Lew? It will
overdraw your expendable budget in your ARPA contract and there is no
money for capital expenditures. Fran
∂07-Oct-82 1723 Carolyn Tajnai <CSD.TAJNAI at SU-SCORE> Student Resumes
Date: 7 Oct 1982 1509-PDT
From: Carolyn Tajnai <CSD.TAJNAI at SU-SCORE>
Subject: Student Resumes
To: CSD-Faculty: ;
Please encourage all of your advisees to submit resumes for the
1983 Forum Booklet ``Resumes of Graduate Students''. Information is
posted on BBOARD and I have handed out hardcopy notices.
Thanks,
Carolyn
-------
∂08-Oct-82 0851 Chappell at SRI-AI TODAY'S TINLUNCH
Date: 8 Oct 1982 0850-PDT
From: Chappell at SRI-AI
Subject: TODAY'S TINLUNCH
To: TINlunchers:
cc: chappell
From: Kurt Konolige
The TINLUNCH will be held on Friday (this week only), October 8, 1982
in room EK242 at lunchtime. The paper that will be discussed is
CIRCUMSCRIPTION IMPLIES PREDICATE COMPLETION (SOMETIMES)
by
Raymond Reiter
The author will not be present. Copies of this week's presentation
are on Elsie Chappell's file cabinet (EJ251). This paper can also be
found in AAAI-82 PROCEEDINGS OF THE NATIONAL CONFERENCE ON ARTIFICIAL
INTELLIGENCE, pages 418-420. Robert Moore will be presenting next
week's TINLUNCH on Thursday, October 14 at lunchtime.
-------
∂08-Oct-82 0900 JMC*
ABSTRACT!!!
∂08-Oct-82 0915 Chappell at SRI-AI FAEHNRICH & FAUSER PRESENTATION
Date: 8 Oct 1982 0914-PDT
From: Chappell at SRI-AI
Subject: FAEHNRICH & FAUSER PRESENTATION
To: AIC-Associates:
cc: CHAPPELL
Date: 4 Oct 1982 1035-PDT
From: Don Walker <WALKER at SRI-AI>
Subject: interface talk Monday, 11 Oct., 10:30
To: AIC-Associates: ;
Speakers: K-P Faehnrich and A. Fauser
Fraunhofer-Institut fuer Arbeitswirtschaft und Organisation
Where: EJ222
TOPICS FOR THE PRESENTATION
Who we are:
The Fraunhofer-Society is the largest German instition for applied research
(some 3,000 researchers). Its work and especially the research areas at our
institute, the Fraunhofer-Institut fuer Arbeitswirtschaft und Organisation,
will be presented.
What we are doing:
A central topic of research at our institute is ergonomics and man-machine
interaction. In the presentation, work on three issues will be presented:
- dialogue design in production applications: interfacing to a CNC-machine
- standardization activities for human-oriented dialogue software
- natural language interfaces: design of a natural language dialogue system
with heterarchical control structure, object-oriented knowledge base and
pragmatics-based reference resolution
-------
-------
-------
∂08-Oct-82 1019 JJW MTC Qual
To: JMC, ZM
The file MTC.SYL[INF,CSD] contains the syllabus for the qual given
last year. I would like to know if there are going to be any changes
to it.
As far as I know, the people taking this qual will be Ross Finlayson,
Yoram Moses, Mike Spreitzer (probably), and Joe Weening.
∂08-Oct-82 1046 Jeffrey D. Ullman <CSD.ULLMAN at SU-SCORE> VLSI seminar
Date: 8 Oct 1982 0929-PDT
From: Jeffrey D. Ullman <CSD.ULLMAN at SU-SCORE>
Subject: VLSI seminar
To: aflb.local at SU-SCORE
There is a VLSI theory seminar (no credit) that has started up
on Wednesdays, in MJH 352, at 4:15PM. It consists of informal talks
on work done by the participants and on journal articles.
Please send me a message if you are interested in being on the mailing
list.
-------
∂08-Oct-82 1519 Paul Armer <CSD.ARMER at SU-SCORE> Support Needed
Date: 8 Oct 1982 1516-PDT
From: Paul Armer <CSD.ARMER at SU-SCORE>
Subject: Support Needed
To: CSD-Faculty: ;
Stanford-Phone: (415) 497-2906
It looks as though we have managed to find support for all our
Ph.D students except for William Burley. He has an NSF Fellowship
so we are in need of only a 10% RA-ship for him. He gives his interests
as MTC and AA. He has an AB in Computer Science from Cornell -- his
quantative GRE score was 800 (99%) and his advanced GRE score in
computer science was 830(98%). Can anyone out there take him onhim on?
Paul
-------
∂08-Oct-82 1556 Irmgild Schack <CSD.IRMGILD at SU-SCORE> Dinner with Barbara Liskov
Date: 8 Oct 1982 1555-PDT
From: Irmgild Schack <CSD.IRMGILD at SU-SCORE>
Subject: Dinner with Barbara Liskov
To: faculty at SU-SCORE
It turns out that Barbara Liskov is missing our Mexican cuisine greatly!
Therefore, we'll have dinner at Caleta (1143 Crane Street, Menlo Park).
The prize should again be $10.00 per person. Please let me know if you
can come.
Gene
cc:Liskov@MIT-dms
-------
∂08-Oct-82 1857 JK
To: JMC, JJW
∂08-Oct-82 2043 Grosz at SRI-AI change in day
Date: 8 Oct 1982 2041-PDT
From: Grosz at SRI-AI
Subject: change in day
To: TINlunchers:
cc: chappell
Tinlunch is being moved (back) to Friday noon. The shift to Friday will
be in effect this coming week (i.e., Bob Moore's tinlunch will be on
Friday).
-------
∂09-Oct-82 1910 LGC Paper for Tuesday
As background for our Advice-Taker discussion of non-monotonic reasoning next
Tuesday, it will be very helpful if you'll review my paper "On the Epistemology
of Commonsense Factual Reasoning", in which I provide detailed analyses of
work by McCarthy, Doyle, McDermott & Doyle, and Reiter, as well as a general
overview of my proposed alternative approach. I think this will save time by
helping us to focus quickly on the essential issues. I put a copy of the
paper in your mailbox yesterday, in case your other copy is no longer readily
accessible. Also, I may have written up by Monday a short new piece on the
conceptual resources needed for the statement of rules of evidence and/or
inference of various kinds. In it, I hope to clarify a theoretical issue
that I think may underlie some of the uneasiness you expressed last week.
-- Lew
∂09-Oct-82 1955 Bill Gosper <RWG at MIT-MC> complex numbers
Date: 9 October 1982 22:55-EDT
From: Bill Gosper <RWG at MIT-MC>
Subject: complex numbers
To: jmc at SU-AI
(orginal note from dove objected to lispm automatically converting
complexes with 0 imagpart to reals.) (defsubst is basically
open coding.)
Date: 9 Oct 1982 17:03:44-EDT
From: dove at mit-dspg
To: ALAN@mit-mc
Subject: complex numbers revert to reals
Cc: BUG-LISPM@mit-oz
From ALAN@MIT-MC Fri Oct 8 23:15:44 1982
The difference between reverting a complex number to a real
number and reverting a flonum to a fixnum is that the behavior
of a complex number with a zero imaginary part is (should be)
identical to the behavior of a rure real number, while the
behavior of a flonum 3.0 is quite different from that of a
fixnum 3. (Flonums do not behave as if they were elements of
the field of real numbers. If they did then it would be
correct to revert to fixnums which ARE a correct implementation
of the sub-ring of integers, but since flonums aren't, we
don't.)
The advantage in converting to a simpler representation
whenever possible should be obvious. The simpler
representations are more efficient to compute with. Given the
easy type dispatching in the microcode there is little price to
pay for the resulting multiplicity of types.
I don't understand what disadvantage you have found with this
behavior. Nobody has ever had reason to complain about the
automatic reversion from bignums to fixnums. How is this
situation different?
The problem I currently have is that complex arith isn't in ucode. As
a result, the generic ops are very slow. What's worse, I can't just
make a routine to extract the proper field out of a complex and call
it, it has to type check, because you never know when what you get
might have changed back to a real.
I had discovered this by checking the time to compute the vector
magnitude from a complex vector vs one in which the real and imag parts
are separate. The complex version used 12x more time.
RMS had suggested making defsubsts to do complex arith until the stuff
is in ucode. Since extracting the real or imag part is the primary low
level op on complex #'s (in the absence of ucoded fcns) making them
slow is bad. What I have done is implemented defsubsts for realpart
and imagpart that take only about 10usec including a type check. That
should be sufficient for my purposes.
∂09-Oct-82 2233 Lowell Wood <LLW at S1-A> Capsized Temporalization
Date: 09 Oct 1982 2233-PDT
From: Lowell Wood <LLW at S1-A>
Subject: Capsized Temporalization
To: jmc at SU-AI
CC: LLW at S1-A
[John: I gather that the `firm election to temporize' has broken down
somewhat short of the two year span which you mentioned to me previously.
The particular way in which it did so seems regrettable--the ripples
which inevitably spread beyond Stanford will presumably cause both
prospective faculty and future graduate students to wonder "Is this any
way to run a Department?" Lowell]
∂01-Oct-82 1809 Wiederhold at SUMEX-AIM My life at Stanford:
Date: 1 Oct 1982 1804-PDT
From: Wiederhold at SUMEX-AIM
Subject: My life at Stanford:
To: csd.Golub at SU-SCORE, Feigenbaum at SUMEX-AIM, Shortliffe at SUMEX-AIM,
csd.Ullman at SU-SCORE, csd.Armer at SU-SCORE, csd.Betty at SU-SCORE,
pickering at SUMEX-AIM, Blum at SUMEX-AIM, csd.Oliger at SU-SCORE,
Buchanan at SUMEX-AIM, sagalowicz at SRI-AI, csd.Corella at SU-SCORE,
csl.JLH at SU-SCORE, LLW at SU-AI, Mach at USC-ISI, Milton at SRI-AI,
JKaplan at SRI-KL, Kuhn at SRI-KL, PN at SU-AI, Kbms-user at SRI-AI,
csd.Cer at SU-SCORE, Epstein at NLM-MCS, csd.Rogers at SU-SCORE
I sent the following message to my students to keep them informed on
my status:
Dear Students,
Yesterday afternoon Gene Golub informed that the agreement between the
Medical School and the School of Humanities and Sciences which was
to lead to a long term research appointment has been undone. He
considers that now a further appointment at Stanford is quite unlikely.
Ed Feigenbaum will still be dealing at the Provost's level.
Allthough I still have this year an extension of my assistant professor-
ship I feel I cannot be effective in this situation and have asked Gene
Golub for an immediate leave of absence for this fall quarter.
I count on it being granted.
Students who receive financial support from me should continue to receive
it, but I will not be otherwise available. If Jack Milton is willing to
continue making the arrangements for CS345 it can continue this quarter.
Otherwise we may have to stop after the three speakers to whom
committments have been made have presented their work.
I feel very badly about the students who are working on thesis projects with
me. I know that for some of you this decision is quite damaging, but
any further deferral will not make it better. If you feel you have been
deceived by my statements please consider that I could only work with
the information I received. I don't think you will want to go through
another iteration of this type.
Best wishes to all of you.
Gio
-------
∂10-Oct-82 0942 Gene Golub <CSD.GOLUB at SU-SCORE> Re: possible honor
Date: 10 Oct 1982 0943-PDT
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: Re: possible honor
To: JMC at SU-AI
In-Reply-To: Your message of 9-Oct-82 1740-PDT
Congratulations!
GENE
-------
∂10-Oct-82 1101 CLT MTC and FORMAL SYSTEMS SEMINAR
To: "@MTC.DIS[1,CLT]" at SU-AI
TIME: Weds. October 13, 12noon to 1pm +
PLACE: Rm 252 Margaret Jacks Hall
SPEAKER: Ben Moszkowski
Stanford
TITLE: A Temporal Logic for Multi-Level Reasoning about Hardware
Describing even the simplest digital circuits involves concepts such as
concurrency, states, I/O and delay. This talk introduces a formalism
which permits the rigorous specification of a variety of hardware
components and facilitates proving properties such as correctness of
implementation. Conceptual levels of circuit operation ranging from
detailed quantitative timing and signal propagation up to functional
behavior are integrated in a unified way. A temporal logic based on
intervals serves as the formal core, resulting in a versatile tool that
has more descriptive power than any conventional hardware specification
language. The formalism has been applied to specifying and reasoning
about circuits ranging from delay elements up to the Am2901 ALU bit slice.
COMING ATTRACTIONS:
Wednesday October 20 Moshe Vardi, Stanford
On Decomposition of Relational Data Bases
Wednesday October 28 David Plaisted, SRI
A Deductive Program Generation System
∂11-Oct-82 0900 JMC*
Waltuch and Mazda
∂11-Oct-82 0920 FFL Call from Robert Kahn, Lawrence Livermore Lab
To: JMC, FFL
Would like you to appear in press conference this Friday at Press Club
in San Francisco, about 2 p.m., on Orlov and Scharansky. Could you
please let him know promptly. 486 4490.
∂11-Oct-82 1357 RPG Meeting
Can you meet with Lew and I wednesday afternoon instead of tomorrow?
Rod Brooks and I have to got to Livermore tomorrow.
-rpg-
∂11-Oct-82 1425 Paul Armer <CSD.ARMER at SU-SCORE> Support Needed
Date: 11 Oct 1982 1422-PDT
From: Paul Armer <CSD.ARMER at SU-SCORE>
Subject: Support Needed
To: CSD-Faculty: ;
Stanford-Phone: (415) 497-2906
We need a full 50% RA/TA ship for Oren Patashnik. He is interested
in analysis of algorithms, graph theory and combinatorics. Third year
student. B.S. from Yale. TEX experience. Can anyone out there offer
his support??
Paul
-------
∂11-Oct-82 1459 CLT
∂12-Oct-82 1135 FFL
To: JMC, FFL
Please call Robert Kahn re Scharansky. 486-4490.
∂12-Oct-82 1627 JJW
I am going to apply for a Hertz Foundation fellowship for next year.
Would you be willing to write a recommendation for me?
Joe
Yes on Hertz.
∂12-Oct-82 1905 Nilsson at SRI-AI Talk
Date: 12 Oct 1982 1433-PDT
From: Nilsson at SRI-AI
Subject: Talk
To: AIC-Associates:
Sanjai Narain from Rand will be visiting us on Monday, October 18 to
give a talk. 10:30am in K242 (Georgia, can you please reserve the
room for us?). Here's his abstract:
MYCIN: THE EXPERT SYSTEM AND ITS IMPLEMENTATION IN LOGLISP
Sanjai Narain
MYCIN is an expert system that performs medical consultations in the domain
of microbial infection. Expert knowledge has been represented as a set of
IF-THEN decision rules. Consultations are a result of a top down inference
on these rules.
LOGLISP is an extension of LISP in which one can do logic programming. A
logic program consists of a set of logical assertions in IF-THEN format,
that also have a procedural interpretation. Computation is the result of
top down inference on these assertions.
MYCIN's inference mechanism has been reexpressed in LOGLISP. MYCIN's
decision rules, context-tree, functions, knowledge-tables, and data have
also been reexpressed in terms of LOGLISP assertions. The resulting set of
assertions when submitted to the LOGLISP interpreter is found to yield
consultations similar to those performed with MYCIN. Space and time
requirements have also been found to be comparable with those for the
original implementation.
This is a report on an investigation of the effectiveness of a logic
programming system for the implementation of expert systems.
-------
∂12-Oct-82 2123 CLT cleaners
are coming tomorrow morning
∂13-Oct-82 0918 FFL
To: JMC, FFL
Bob Kahn called again. He is very anxious to reach you. He will
be at 486 4490 today.
∂13-Oct-82 1126 ullman@Diablo (SuNet) Peter's Bar Mitzvah
Date: 13 October 1982 11:26:19-PDT (Wednesday)
From: ullman at Diablo
Subject: Peter's Bar Mitzvah
To: jmc at sail, ltp at sail
We have not heard from you whether you will be coming to the
Bar Mitzvah Saturday.
Please let us know if you will be at the reception.
If you are also planning to come to the services, be warned that
you should not come at the time on the invitation.
Probably 11AM is early enough to see Peter to his thing.
∂13-Oct-82 1214 LGC Notes for today
Here are some notes that may be useful in connection with today's discussion
of tweety, etc.; if you don't find them fully intelligible, I can explain
further in person. -- Lew
------------------------------------------------------------
Notes on the Theoretical Foundations of Non-Demonstrative Reasoning Systems
For computational reasoning systems based on the predicate calculus, the
theoretical foundations divide naturally into three parts:
a) semantics of the predicate calculus (model theory),
b) a proof theory for the predicate calculus (consistency, completeness, etc.)
c) computational theory of proof-finding (analysis of search algorithms, etc.).
Each of the first two parts provides a goal and a standard of correctness for
the part that comes after it: the proof theory is shown to correspond in the
right way to the semantics, and the proof-finding algorithms are shown to
correspond in the right way to the proof theory. The developers of
"non-monotonic" logics and forms of reasoning have tended to take this
situation as a paradigm, and appear to think in terms of a similar tripartite
division of metatheory as appropriate for "non-monotonic" computational
reasoning systems. Thus, we find in their work discussions of "model theory
of predicate circumscription", "proof theory for closed normal default
theories", "default reasoning programs", etc.
The purpose of these notes is to argue that the above-described tripartite
model of metatheory must be revised substantially in order to be applicable to
systems for commonsense factual reasoning (CFR). The revisions are required
by the basic structure of CFR.
The first thing to notice is that when we move from the narrow Aristotelian
context of mathematical reasoning to the broader context of CFR in general,
the so-called "rules of deductive inference" become just a subclass of the
Rules of Evidence, and cannot be applied in a given case independently of other
applicable rules of evidence, including non-demonstrative ones
[see LGC: Epistemology of CFR, sec. 2.3, 2.4]. Moreover, only the demonstrative
rules of evidence (i.e., deductive rules plus those rules associated with
meaning postulates) can be justified solely by reference to the truth-semantics
of the underlying language. The (no less important) non-demonstrative rules
(including the Rules 1SE of Statistical Evidence and 1CE of Causal Evidence)
cannot be justified merely by reference to truth-semantics or model theory,
and require for their theoretical foundation an independent theory of rational
belief [see reference 5 in LGC, op. cit.]. Therefore, insofar as it makes
sense to speak of a "proof theory" for CFR, its theoretical basis must be
<<essentially> broader than that of proof theory for predicate calculus.
In what sense can there be a "proof-theory" for CFR that is independent
of the reasoning procedures used to implement it? It is natural to define
a <<CFR inferability structure> as an ordered pair <RE, RWC>, where RE is a set
of rules of evidence, and RWC is a set of rules of weighing and composition
[LGC op. cit.]. Now we can investigate (and perhaps demonstrate) the deductive
completeness and soundness of the demonstrative rules of evidence with respect
to the truth-semantics of the underlying language. And we can say that RWE is
complete with respect to RE just in case RWE provides a resultant epistemic
status for each possible combination of considerations (a given combination
includes given epistemic statuses for all the premises of each consideration).
But we cannot expect to have independent criteria of completeness and soundness
for the non-demonstrative rules of evidence, nor an independent criterion of
soundness for the the rules of weighing and composition. The best that can be
hoped for here is to gradually expand RE and RWC to account for an increasingly
wide range of intuitively sound particular inferences, and to systematize the
inductive intuitions underlying the resulting rules in an axiomatic theory of
rational belief. However, the axioms of such a theory would be as dependent
for their justification on the rules they systematize as the rules would be on
the axioms. Systematized intuitions concerning the soundness of
non-demonstrative inferences are the ultimate court of appeal here.
A CFR inferability structure IS (= <RE, RWC>) determines, for a given body of
knowledge K, and target proposition ↑s evaluable by IS, an ideally inferable
epistemic status, IS(↑s ,K). A perfect CFR reasoning program based on IS
would be one that always discovered all considerations (i.e., instantiations
of rules in RE) relevant to a given target proposition, and correctly applied
all relevant rules in RWC in composing them, and therefore always yielded the
ideally correct epistemic status IS(↑s, K). However, the best that a mere
human can be expected to do is to find all the relevant considerations (s)he
can, and evaluate them as best (s)he can (given the available time and other
resources), and this is reflected in the Rule of Factual Inference. The
question of the inherent computational difficulty of finding IS(↑s ,K) is
potentially interesting, but would only become well defined with the full
specification of IS and the organization and contents of K. For the present,
we require no more of an AI program in this regard than we do of a human.
This constitutes a further significant departure from the predicate calculus
theorem-proving paradigm, since many inferences that deviate from the CFR
proof-theoretic ideal are regarded as acceptable, rather than as mere
inferential failures.
∂13-Oct-82 1513 JDH incompletes
I still have incompletes from you for 293 Spring 80-81, 390 Summer 80-81,
and I still have an "N" for Autumn 81-82
We should do something about this.
John Hobby
Please make out the cards to change John Hobby's incompletes to A's.
∂13-Oct-82 1544 David Warren <WARREN at SRI-AI> Re: Szeredi note
Date: 13 Oct 1982 1538-PDT
From: David Warren <WARREN at SRI-AI>
Subject: Re: Szeredi note
To: JMC at SU-AI
cc: WARREN at SRI-AI
In-Reply-To: Your message of 13-Oct-82 1526-PDT
OK, I'll unearth Szeredi's note from the pile of items on my desk
and send it back to you. Thanks. --David.
-------
∂13-Oct-82 1737 Andrei Broder <CSD.Broder at SU-SCORE> Next AFLB talks
Date: 11 Oct 1982 1857-PDT
From: Andrei Broder <CSD.Broder at SU-SCORE>
Subject: Next AFLB talks
To: aflb.all at SU-SCORE
cc: csd.dorio at SU-SCORE
Stanford-Office: MJH 325, Tel. (415) 497-1787
T H E N E X T A F L B - T A L Ks
10/14/82 Andrei Broder (Stanford):
A general expression for Abelian identities
The sums of the type
====
\ p+k n-k+q
A (x, y, p, q) = > binomial(n, k) (x + k) (y + n - k)
n /
====
k
were called ``Abelian binomial sums'' by Riordan. With this notation,
the famous Abel identity can be written
-1 n
A (x, y, -1, 0) := x (x + y + n)
n
and the Cauchy formula becomes
====
\ n-k
A (x, y, 0, 0) = > k! binomial(n, k) (y + x + n)
n /
====
k
Riordan exposed a recurrence and a symmetry formula for A[n] and used
them to iteratively derive similar ``Abelian identities'' for p and q
between -3 and 3. In this presentation, an explicit expression, which
appears to be new, is obtained for the Abelian identities, for all
positive p and q, by counting the number of words associated through
the Foata-Fuchs encoding, to a suitably chosen family of mappings.
This expression involves certain combinatorial entities, named
r-Stirling numbers. Some of the properties of the r-Stirling numbers,
such as their relation to Q-polynomials, will also be discussed.
******** Time and place: Oct. 14, 12:30pm in MJ352 (Bldg. 460) ********
10/21/82 John Rhodes (Berkeley):
"New Algebraic Methods for the Manipulation of Formal Languages"
Regular or finite state languages have a well-developed and
powerful algebraic theory. However, finite state languages are
usually too restrictive a class for significant applications in
computer science.
This talk generalizes the powerful algebraic techniques,
heretofore only applicable to finite state languages, to context-free,
recursive and in fact arbitrary languages. It yields a powerful
method to determine membership on parsing in languages currently
important in computer science.
******** Time and place: Oct. 21, 12:30pm in MJ352 (Bldg. 460) *******
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Regular AFLB meetings are on Thursdays, at 12:30pm, in MJ352 (Bldg.
460).
If you have a topic you would like to talk about in the AFLB seminar
please tell me. (csd.broder@score, MJH325, 497-1787) Contributions
are wanted and welcome. Not all time slots for this year have been
filled so far.
For more information about future AFLB meetings and topics you might
want to look at the file [SCORE]<csd.broder>aflb.bbboard.
-------
∂13-Oct-82 1742 Lowell Wood <LLW at S1-A> Plans
Date: 13 Oct 1982 1741-PDT
From: Lowell Wood <LLW at S1-A>
Subject: Plans
To: jmc at SU-AI
CC: LLW at S1-A
∂13-Oct-82 1457 John McCarthy <JMC at SU-AI>
Date: 13 Oct 1982 1457-PDT
From: John McCarthy <JMC at SU-AI>
To: llw at S1-A
My LLNL contract is renewed. When is a good time to catch you?
[John: I'm around all the rest of this week, including the weekend.
Next week is still a bit up in the air (I have to go East sometime,
but haven't yet been told when). Lowell]
∂13-Oct-82 1744 Andrei Broder <CSD.Broder at SU-SCORE> Next AFLB talks
Date: 11 Oct 1982 1902-PDT
From: Andrei Broder <CSD.Broder at SU-SCORE>
Subject: Next AFLB talks
To: aflb.all at SU-SCORE
cc: csd.dorio at SU-SCORE
Stanford-Office: MJH 325, Tel. (415) 497-1787
T H E N E X T A F L B - T A L Ks
10/14/82 Andrei Broder (Stanford):
A general expression for Abelian identities
The sums of the type
====
\ p+k n-k+q
A (x, y, p, q) = > binomial(n, k) (x + k) (y + n - k)
n /
====
k
were called ``Abelian binomial sums'' by Riordan. With this notation,
the famous Abel identity can be written
-1 n
A (x, y, -1, 0) := x (x + y + n)
n
and the Cauchy formula becomes
====
\ n-k
A (x, y, 0, 0) = > k! binomial(n, k) (y + x + n)
n /
====
k
Riordan exposed a recurrence and a symmetry formula for A[n] and used
them to iteratively derive similar ``Abelian identities'' for p and q
between -3 and 3. In this presentation, an explicit expression, which
appears to be new, is obtained for the Abelian identities, for all
positive p and q, by counting the number of words associated through
the Foata-Fuchs encoding, to a suitably chosen family of mappings.
This expression involves certain combinatorial entities, named
r-Stirling numbers. Some of the properties of the r-Stirling numbers,
such as their relation to Q-polynomials, will also be discussed.
******** Time and place: Oct. 14, 12:30pm in MJ352 (Bldg. 460) ********
10/21/82 John Rhodes (Berkeley):
"New Algebraic Methods for the Manipulation of Formal Languages"
Regular or finite state languages have a well-developed and
powerful algebraic theory. However, finite state languages are
usually too restrictive a class for significant applications in
computer science.
This talk generalizes the powerful algebraic techniques,
heretofore only applicable to finite state languages, to context-free,
recursive and in fact arbitrary languages. It yields a powerful
method to determine membership on parsing in languages currently
important in computer science.
******** Time and place: Oct. 21, 12:30pm in MJ352 (Bldg. 460) *******
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Regular AFLB meetings are on Thursdays, at 12:30pm, in MJ352 (Bldg.
460).
If you have a topic you would like to talk about in the AFLB seminar
please tell me. (csd.broder@score, MJH325, 497-1787) Contributions
are wanted and welcome. Not all time slots for this year have been
filled so far.
For more information about future AFLB meetings and topics you might
want to look at the file [SCORE]<csd.broder>aflb.bbboard.
-------
-------
∂13-Oct-82 1801 P. Cheeseman <cheeseman at SRI-AI> Time in Planning talk.
Date: 13 Oct 1982 1751-PDT
From: P. Cheeseman <cheeseman at SRI-AI>
Subject: Time in Planning talk.
To: AIC-Associates: ;
A talk by Peter Cheeseman entitled:
"A Representation of Time for Planning".
Will be given on Tuesday, 19th. October, in EK242, at 1:30 p.m.
Abstract
--------
Existing planners represent time as a sequence of world descriptions
(states), with operators to map from one state to another. Such state
based representations make it difficult to represent continuously changing
quantities and to represent conditions during an operator application. A
new representation will be presented which avoids these difficulties. This
representation consists of a set of world descriptions, where each world is
described over all time. Operators now map from one world description to
another, (hopefully one in which more goals are satisfied). Individual
propositions in a world description are asserted true over a given interval.
Advantages of an interval based representation will be given.
-------
∂13-Oct-82 1911 Chappell at SRI-AI FRIDAY'S TINLUNCH
Date: 13 Oct 1982 1908-PDT
From: Chappell at SRI-AI
Subject: FRIDAY'S TINLUNCH
To: TINlunchers:
cc: CHAPPELL
From: Robert Moore
The TINLUNCH will be held on Friday , October 15, 1982 in room EK242
at lunchtime. The paper that will be discussed is
Some ANY'S Mean Some*
by
William A. Ladusaw
The author will not be present. Copies of this week's presentation
are on Elsie Chappell's file cabinet (EJ251). Lauri Karttunen will be
in charge of next week's (October 22, 1982) presentation. A guest
speaker is expected.
Note: TINLUNCH will now be on FRIDAY'S at noon.
-------
∂13-Oct-82 2109 WIEDERHOLD at SUMEX-AIM
Date: 13 Oct 1982 2052-PDT
From: WIEDERHOLD at SUMEX-AIM
To: JMC at SU-AI
In-Reply-To: Your message of 13-Oct-82 1459-PDT
phone anytime 7am -12midnight 493-8363
Stanford irregular, will be there tomorrow morning by 10:30, can come in earlier
if you want to see me. Saw you actually yesterday at about 10pm,
but you were engrossed and i was rushing to get the alphatype going.
Gio
-------
∂13-Oct-82 2114 WIEDERHOLD at SRI-AI coordinates
Date: 13 Oct 1982 2101-PDT
From: WIEDERHOLD at SRI-AI
Subject: coordinates
To: jmc at SU-AI
I am at home when I am not consulting : 493-8363, and
irregularily at Stanford - tomorrow for instance at 10:30 -
to take care of outstanding business.
If you send me message I can come in earlier - am using SRI again because
SUMEX ( where my SAIL mail is forwarded ) just crashed.
Saw you yesterday at 10pm while fixing the alphatype, but you were engrossed.
Gio
-------
∂14-Oct-82 0251 Mike Farmwald <PMF at S1-A> Saturday Badging Questions
Date: 14 Oct 1982 0252-PDT
From: Mike Farmwald <PMF at S1-A>
Subject: Saturday Badging Questions
To: GAP at S1-A
CC: LLW at S1-A, jmc at SU-AI
∂14-Oct-82 0005 John McCarthy <JMC at SU-AI> Saturday if a problem can be solved
Date: 14 Oct 1982 0000-PDT
From: John McCarthy <JMC at SU-AI>
Subject: Saturday if a problem can be solved
To: llw at S1-A
I have appointments Thursday and Friday but could come Saturday.
However, there would have to be some way of getting them to make
the badge that expired Sept. 30 good for that day, since I don't
suppose a new one can be made on Saturday. If that problem doesn't
appeal to you, we'll make it when you have time again.
[Gloria, will you see if we can have a new badge made for JMC and
waiting at the South Main Gate guard kiosk for Saturday? If they
can't come up with a badge for the entire FY'83 period, can they
make a this-day-only one just for Saturday? Thanks, Lowell]
∂14-Oct-82 0905 Betty Scott <CSD.BSCOTT at SU-SCORE>
Date: 14 Oct 1982 0854-PDT
From: Betty Scott <CSD.BSCOTT at SU-SCORE>
To: JMC at SU-AI
cc: CSD.BSCOTT at SU-SCORE
In-Reply-To: Your message of 13-Oct-82 1618-PDT
I agree that Fran won't be easy to replace--I will try and get the job
posted with Personnel today. Do you want to interview, or do you have
any special instructions on a replacement? I think it goes without saying
that unless someone in the department is interested in the job (perhaps
as a promotion), then we have to start anew on SAIL instruction. Offhand,
I can't think of anyone in the Department who could do the job. It has to
be someone who can work accurately with your research accounts.
Betty
-------
∂14-Oct-82 0911 Paula Bauman <PJB at S1-A> Badge
Date: 14 Oct 1982 0911-PDT
From: Paula Bauman <PJB at S1-A>
Subject: Badge
To: jmc at SU-AI
CC: CEG at S1-A, GAP at S1-A
A new badge can be obtained from the South Badge Office, the next time
you plan to come to the Lab. You simply explain that your consulting
agreement has been renewed, effective 10/1/82 thru 9/30/83. They have
a list of renewed consultants, and you name should be on that. They will
then issue you a new badge at that time. Remember, they have working
hours of 8:00 a.m. to 4:30 p.m., Monday thru Friday.
It also would be a good idea if you knew a day ahead of time that you
would be coming in to let me know. I will call the badge office for you
and let them know when you will be arriving, so they will be expecting you.
This might make things go smoother.-Paula
∂14-Oct-82 0916 Nancy Dorio <CSD.DORIO at SU-SCORE> ADDENDUM TO COLLOQUIUM NOTICE WEEK OF OCTOBER 18 - 22, 1982
Date: 14 Oct 1982 0907-PDT
From: Nancy Dorio <CSD.DORIO at SU-SCORE>
Subject: ADDENDUM TO COLLOQUIUM NOTICE WEEK OF OCTOBER 18 - 22, 1982
To: colloq: ;
Stanford-Phone: (415) 497-2273
Medical Computing Journal Club - Tuesday, October 19, at 1:30 p.m. in MJ352.
Mr. Lee Court, Director of Stanford University Hospital, Information
Systems, will speak on "Selection and Implementation of a Hospital
Information System for Stanford Hopital."
Special Seminar - Wednesday, October 20, at 2 p.m. in MJ252. Mr. Vincent
Morice, from the University Pierre, Paris, will speak on "A Production Rule
Based System for the Management of Hypertension."
-------
∂14-Oct-82 1022 BrianSmith at PARC-MAXC A Reflective Dialect of PROLOG
Date: 14 Oct 1982 10:20 PDT
From: BrianSmith at PARC-MAXC
Subject: A Reflective Dialect of PROLOG
To: desRivieres, Deutsch, Levesque@SRI-KL, McCarthy@SU-AI, Moore@SRI-AI,
Perreira@SRI-AI, Warren@SRI-AI
cc: BrianSmith
As some of you know, I would like to construct "3-PROLOG": a reflective
dialect of PROLOG, in which both procedural and declarative semantics
are explicitly axiomatised, and in which control is specified by explicit
statements in the language of these theories, rather than with the usual
extra-logical annotations. In some respects 3-LISP can be used as a guide,
but there will be many questions that arise in 3-PROLOG's case that I
haven't dealt with before (such as for example what role an axiomatisation
of reference could play). Also, I think the PROLOG that would result
would be very interesting and quite possibly even useful (for example,
we might be able to get past the restriction to Horn clauses).
It would be fun and productive to make this a small collective project;
certainly I am no PROLOG expert, as some of you are. Therefore I have
set up a meeting, tentatively scheduled for 9:00 on Thursday morning
October 21, here at Parc Place, to which you are all invited. The idea
would be to explore what would be involved in a 3-PROLOG project, to
decide whether it would be worth pursuing, and so forth, and (if all goes
well) maybe to plot a little how we might proceed. So: please let me know
a) if you are interested, and b) whether you would be able to come next
Thursday. Also, although I think it will be important to keep the group
small, if there is someone who would be an obvious participant whom I
have neglected to invite, you should let me know.
Thanks very much.
Brian
I'm interested in the reflective Prolog project and can come.
If Bob Moore persuades you to change the time, I prefer a
later hour, since 9am is always difficult for me, since I'm smarter later
in the day. As I mentioned to you Peter Szeredi wrote, at my
instigation, a Prolog interpreter with some "introspective"
capability, and I think this overlaps your notion of reflectivity.
After thinking about "introspective Prolog" in connection with
what I called the Kowalski doctrine, I couldn't convince myself that
introspection, in the sense of the ability to examine the state, was
much more than a curiousity, i.e. that it had applications. It
isn't apparent that it corresponds to human reflective abilities,
since humans don't examine the "raw state", but only certain aspects
of the state.
∂14-Oct-82 1109 Bob Moore <BMOORE at SRI-AI> Re: A Reflective Dialect of PROLOG
Date: 14 Oct 1982 1056-PDT
From: Bob Moore <BMOORE at SRI-AI>
Subject: Re: A Reflective Dialect of PROLOG
To: BrianSmith at PARC-MAXC, desRivieres at PARC-MAXC, Deutsch at PARC-MAXC,
Levesque at SRI-KL, McCarthy at SU-AI, Moore at SRI-AI, Warren at SRI-AI
cc: BMOORE at SRI-AI
In-Reply-To: Your message of 14-Oct-82 1020-PDT
Brian,
I would like to come, but Thursdays at 9:00 are impossible for me--almost
any other time is OK.
--Bob
-------
∂14-Oct-82 1130 FFL
To: JMC, FFL
Nils Nilsson returned your call. He will be in and out, but when in
his number is 859 2311.
∂14-Oct-82 2033 RPG Friday
I am tied up all day tomorrow, so a 5pm meeting will not work for me.
Perhaps monday?
-rpg-
∂15-Oct-82 1105 CLT SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
To: "@DIS.DIS[1,CLT]" at SU-AI
Speaker: Albert Visser
Title: Some Approaches to the Liar
Time: Monday, October 18, 3:30-5:00
Place: Room 383N Math. Bldg.
∂15-Oct-82 1300 Lowell Wood <LLW at S1-A> This PM
Date: 15 Oct 1982 1256-PDT
From: Lowell Wood <LLW at S1-A>
Subject: This PM
To: JMC at S1-A, jmc at SU-AI
CC: LLW at S1-A
John, there are quite reliable indications that the session this
PM will be completed by 1500. The local Badge Office closes at
1600. If you get here at, for instance, 1430, you should be well-
badged by the time I'm through. Alternatively, the weekend still
is good from my standpoint. Lowell
∂15-Oct-82 1331 LGC Meeting
RPG will be tied up until 6pm today, so it doesn't seem a good day for
a 3-way meeting. But if you think it would be useful for the two of us
to discuss some of the material in my paper or in PLARG/7P (Dick showed
me that the latter notes are overly concise and somewhat cryptic in spots),
I could still make a meeting at 5pm or so today. If not, then perhaps next
Tuesday at 3pm would be a good time. -- Lew
∂15-Oct-82 1339 Carolyn Tajnai <CSD.TAJNAI at SU-SCORE> Forum 15th Annual Meeting
Date: 15 Oct 1982 1335-PDT
From: Carolyn Tajnai <CSD.TAJNAI at SU-SCORE>
Subject: Forum 15th Annual Meeting
To: CSD-Faculty: ;
Doug Lenat is the program chairman for the 15th Annual Meeting that will
be held February 3/4 1983 -- MARK CALENDARS NOW!
Send names of your students who are ready to give talks at the
meeting. Mail to Forum@Score. This should receive high priority.
Our Forum members have expressed a desire to receive information on
the program in advance of the meeting. Doug and I want to plan the
program and mail the invitations, advance program, and the Student
Resume Booklets in early December.
There will be an informal buffet supper at the Faculty Club on
Wednesday night, Feb. 2. It will be for Forum members, who will
arrive early, and the faculty. So mark that night on your calendar
also. I will notify you in advance who will be attending from the
Forum companies. Most important will be for you to attend if someone
from one of your companies is planning to attend.
And the good news is that Vint Cerf has accepted our invitation to be
the banquet speaker.
Information: A quick way to look up information on a Forum company is
to type to the monitor:
@find BNR in <csl.forum>forum.dat
information can be found on prospects the same way
@find Honeywell in <csl.forum>prospect.dat
Carolyn
-------
∂15-Oct-82 1505 FFL
To: JMC, FFL
Susan can have lunch with you on Monday.
∂15-Oct-82 1536 Andrei Broder <CSD.Broder at SU-SCORE> Speaker(s) needed
Date: 15 Oct 1982 1333-PDT
From: Andrei Broder <CSD.Broder at SU-SCORE>
Subject: Speaker(s) needed
To: aflb.all at SU-SCORE
Stanford-Office: MJH 325, Tel. (415) 497-1787
We need a speaker for Oct. 28, and also for some later dates.
Help! - Andrei
-------
∂15-Oct-82 1549 FFL
To: JMC, FFL
∂15-Oct-82 1414 JMC 1. and 2.
1. I have gone to Livermore.
2. Could you make some notes for your successor about the computer and other
files you keep for me?
Yes, I have told Betty that I will come in on an hourly basis to help
a new person the first two weeks of November if you wish. I will make
some notes and show you where some vital items are located in the files.
∂15-Oct-82 2126 CLT MTC and FORMAL SYSTEMS SEMINAR
To: "@MTC.DIS[1,CLT]" at SU-AI
TIME: Weds. October 20, 12noon to 1pm +
PLACE: Rm 252 Margaret Jacks Hall
SPEAKER: Moshe Vardi
Stanford
TITLE: On Decomposition of Relational Data Bases
Model theory studies the power of 1st-order logic to define relations in terms
of other relations. Database theory studies decompositions of databases, i.e.,
breaking databases into smaller commponents. In this talk I'll showw how to
apply what we know about definability from model theory to the study of database
decompositions.
COMING ATTRACTIONS:
Wednesday October 28 David Plaisted, SRI
A Deductive Program Generation System
∂17-Oct-82 1255 Gene Golub <CSD.GOLUB at SU-SCORE> Reception
Date: 17 Oct 1982 1252-PDT
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: Reception
To: JmC at SU-AI
John! I hope you can come to thge reception at my house this afternoon.
GENE
-------
∂18-Oct-82 1051 FFL
To: JMC, FFL
Dr. Huong from Comtex wants to know if you will write the introduction to
the microfiche collection of AI from Stanford for them. Pls. call her
at 212 838 7200.
∂18-Oct-82 1134 Tom Wadlow <TAW at S1-A>
Date: 18 Oct 1982 1131-PDT
From: Tom Wadlow <TAW at S1-A>
To: jmc at SU-AI
John,
Would you be interested in speaking at BAYCON (a science-fiction
convention to be held in San Jose over the Thanksgiving weekend)? The
local L-5 society is handling the technical track of programming for
the convention. Topics and firm times have not yet been established,
but I rather suspect you can talk about whatever you want. Or be
on a panel discussion, if you like. If you are interested,
please give me a phone number where you can be reached and the program
chairman will be in touch. Thanks --Tom
∂18-Oct-82 1138 Gene Golub <CSD.GOLUB at SU-SCORE> lunch on Tuesday
Date: 18 Oct 1982 1131-PDT
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: lunch on Tuesday
To: faculty at SU-SCORE
Last week we did not have much chance for a focused discussion.
There are two topics we need to talk about this week.
1) Ralph Gorin will discuss the proposal for a new department
machine and its support.
2) Jeff Ullman will say a few words about WISC and how it might
be helpful in supporting the department.
GENE
-------
∂18-Oct-82 1147 FFL
To: JMC, FFL
Meera Blattner from Livermore called re scheduling a seminar there.
The usual time is on Wednesday at 3 p.m., but she can set it on a day
when you are there consulting if you wish. Would you please call her
about it.
?
She will be in all day on Tuesday. 415 422 3503.
∂18-Oct-82 1225 Paul Armer <CSD.ARMER at SU-SCORE> Admissions Committee
Date: 18 Oct 1982 1217-PDT
From: Paul Armer <CSD.ARMER at SU-SCORE>
Subject: Admissions Committee
To: reid at SU-SHASTA at SU-SCORE
cc: csd.golub at SU-SCORE, jgh at SU-AI, csl.lantz at SU-SCORE, jmc at SU-AI,
csd.pratt at SU-SCORE, klc at SU-AI, rsf at SU-AI
Stanford-Phone: (415) 497-2906
Although Gene has yet to release the full list of committee assignments,
I think I can release to you the tentative list for the admissions committee
since it is made up entirely of people who volunteered for it. So it
should be fairly well set. The tentative list is Reid (chairperson),
Herriot,Lantz, McCarthy, Pratt, Armer, Clarkson and Finlayson.
Paul
-------
∂18-Oct-82 1240 BrianSmith at PARC-MAXC Re: A Reflective Dialect of PROLOG
Date: 18 Oct 1982 12:40 PDT
From: BrianSmith at PARC-MAXC
Subject: Re: A Reflective Dialect of PROLOG
In-reply-to: BMOORE's message of 14 Oct 1982 1056-PDT
To: BMoore@SRI-AI, desRivieres, Deutsch, Levesque@SRI-KL, JMC@SU-AI,
Pereira@SRI-AI, Warren@SRI-AI
cc: BrianSmith
Due to popular demand, I am changing the time of the 3-PROLOG
meeting to 1:00 p.m. on Thursday Oct. 21 (same day as before). I think
that this is OK with those who could come before, and is better for
some. Let me know if this unintentionally messes things up.
Otherwise, see you on Thursday.
Brian
Whether unintentional or not, it messes things up for me. I teach
from 1:15 to 2:30 on Tuesdays and Thursdays.
∂18-Oct-82 1403 CLT featherbed
the other cover is ready (I think its filed under Talcott, but not sure)
∂18-Oct-82 1534 LGC Discussion tomorrow at 3pm?
Is 3pm tomorrow ok for our 3-way advice-taker discussion?
3pm will be fine.
∂19-Oct-82 0939 BrianSmith at PARC-MAXC Meeting on Thursday
Date: 19 Oct 1982 09:39 PDT
From: BrianSmith at PARC-MAXC
Subject: Meeting on Thursday
In-reply-to: Your message of 18 Oct 1982 1439-PDT
To: John McCarthy <JMC at SU-AI>
cc: briansmith
My apologies: I had mistakenly remember your class as being at 11:00.
As I recall, before class isn't the best time; would 3:00 on Thursday be
possible?
Brian
3 on Thursday would be fine.
∂19-Oct-82 2321 Gene Golub <CSD.GOLUB at SU-SCORE> Sexism and Racism
Date: 19 Oct 1982 2256-PDT
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: Sexism and Racism
To: su-bboards at SU-SCORE
cc: faculty at SU-SCORE
Recently an offensive sexist remark appeared on BBOARD. The policy of this
Department is the same as that of the University. Namely, this institution
is unconditionally opposed to sexism, racism and any degradation of the
human spirit. It is not possible or desirable for me to censor what appears
on BBOARD. Therefore BBOARD remains an open forum for communication even
though it may be abused.
We should all consider means by which we can increase the awareness of our
colleagues to these problems. It is desirable to take positive action so that
we are all more sensitive to this issue.
I do feel that it is rather shameful that there are no female or minority
members on the faculty. I hope we can find a means to alter this situation
during my tenure as chairman. I was pleased to see that we had an increased
number of women graduate students this past year and I hope this trend will
continue.
GENE GOLUB
-------
I don't know what you mean by "positive action", but I would oppose it
if it involved open or disguised quotas or any other
form of positive discrimination.
∂20-Oct-82 0757 Gene Golub <CSD.GOLUB at SU-SCORE>
Date: 20 Oct 1982 0751-PDT
From: Gene Golub <CSD.GOLUB at SU-SCORE>
To: JMC at SU-AI
In-Reply-To: Your message of 19-Oct-82 2336-PDT
No quotas are implied which I find offensive too. We can however
act with sympathy and give encouragement. I think I understand
your position pretty well by now. GENE
-------
∂20-Oct-82 0900 JMC*
Susie, Lindstrom, Hurd
∂20-Oct-82 1200 BrianSmith Last Announcement
Date: 20 Oct 1982 11:57 PDT
Sender: BrianSmith at PARC-MAXC
From: BrianSmith
Subject: Last Announcement
To: BMoore@SRI-AI, desRivieres, Deutsch, Levesque@SRI-KL, JMC@SU-AI,
Pereira@SRI-AI, Warren@SRI-AI
cc: BrianSmith
As you should all individually know by now, we are going to meet
at 3:00 tomorrow (rather than at 9:00 or at 1:00). Apologies for the
rescheduling. Also, even with this new time, Hector Levesque will
have to scoot away early, so if we could start promptly that would
be best.
Thanks very much.
Brian
∂20-Oct-82 1543 RPG Budget
BS and FFL worked up the Common Lisp budget and it is $90k the
first year, $99K the second year $110k the third.
-rpg-
∂21-Oct-82 0027 JJW 206 homework
Do you want to give an assignment on proving soon? How about if I think
up problems to give next Tuesday, due the following Tuesday.
Also, the midterm is scheduled for Thursday, November 4. What preparations
should be made for this?
I think we should give a few easy proving problems tomorrow due in
a week and a half. See what you can come up with. I am thinking of
giving a more substantial pure Lisp programming problem also.
∂21-Oct-82 0059 ME modem problem?
∂20-Oct-82 2228 JMC datamedia problem
This has been a problem for a long time, but I wonder what you know
about it. When I type to E, I often get bits of the WHO line
in my output. I suppose it represents some interference between
echoing my characters and writing the WHO line. Is there anything
to be done about it?
ME - Sounds like a modem or possibly phone line problem. We could
try a different modem. Another possibility is to adjust the transmit
level down a little on your current modem.
∂21-Oct-82 1012 CLT SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
To: "@LOGIC.DIS[1,CLT]" at SU-AI
Speaker: Albert Visser
Title: Some Approaches to the `Liar' (contd.)
Time: Monday, October 25, 3:30-5:00
Place: Room 383N Math. Bldg.
There won't be Wiederhold money. We have a budget of 90K which we
can send you.
∂21-Oct-82 1108 Gene Golub <CSD.GOLUB at SU-SCORE> Wiederhold
Date: 21 Oct 1982 1047-PDT
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: Wiederhold
To: faculty at SU-SCORE
cc: gorin at SU-SCORE, bscott at SU-SCORE
The Wiederhold situation has changed again!
It appears that it will all be resolved satisfactorily with Gio
having a joint appointment. This was resolved at the Provost's
level so that there seems to be no further problems.
GENE
-------
∂21-Oct-82 1144 FFL Call from Barbara Hodges, Portland, 503 224 5505
To: JMC, FFL
She is working for a search firm there which is filling positions in
a new high technology company funded from Singapore. Looking for
qualified people and money is no object if they get the best, she says.
Would like to speak to you about referrals.
∂21-Oct-82 1152 FFL
To: JMC, FFL
Please call Prof. Kline at 7-2176.
∂21-Oct-82 1422 Gene Golub <CSD.GOLUB at SU-SCORE> Absence
Date: 21 Oct 1982 1357-PDT
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: Absence
To: faculty at SU-SCORE
I shall be away from the office Oct 22 until Oct 27. Irmgild
can give you my phone number if necessary. GENEE
-------
∂21-Oct-82 2229 Gene Golub <CSD.GOLUB at SU-SCORE> [Don Knuth <DEK at SU-AI>: space concerns]
Date: 21 Oct 1982 2220-PDT
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: [Don Knuth <DEK at SU-AI>: space concerns]
To: FACULTY at SU-SCORE
Here are Don's comments on space. GENE
---------------
Mail-from: ARPANET site SU-AI rcvd at 21-Oct-82 1727-PDT
Date: 21 Oct 1982 1704-PDT
From: Don Knuth <DEK at SU-AI>
Subject: space concerns
To: GHG at SU-AI
Please circulate this to the faculty if you think it deserves it.
I just want to "squeak" a bit for the rest of the faculty, so that
we have a chance of getting some lubrication if any solution to the
space problem arises.
Although the HPP group has been most aggressively pointing out their
need for space, the fact is that the other wings of the department
are growing too. In my own case, I have had to severely cut down
on the number of visitors that I think have always been beneficial
to my research in the past; and I constantly see new opportunities
that must be dropped because there is no space. Also, I can't conduct
the kind of font research I would like to, because there's no place
to put the equipment, much less the dozen or so students I expect
will want to be working on this. I'm sure every faculty member
feels that we have come to a point where there's no flexibility now;
and then we look at the computer facilities that are scheduled to
arrive, and we see that the things are going to get even worse.
Even sardines can't survive arbitrarily tight packing!
Thus, I breathed a sigh a relief at the news that HPP would be
getting space in another place. Not that I want to see them go, but
because I realize that more total space is absolutely needed.
But now I can't see why it would be best for them to move into
new space while retaining the space they already have here. That
means that all the rest of us who are growing have to split up too.
Surely it would be much better, given that HPP is doing some moving
anyway, for them to vacate enough space to accommodate the needs
of the rest of us and a little more besides for flexibility.
I would like to be able to have visitors again to my AA project
in three years. I would like to see Christos Papdimitriou housed
in our building if he accepts Stanford's offer. I would like to
buy the typesetter I have budgeted. I would like to have a desk for
four students to share as they work with Metafont. I would like to
explore the possibility of hiring Ron Graham (rumors are strong that
he might be interested). I would like the other professors in the
department to be able to have visitors and lab facilities they
need for their research. And so on, and so on; we can't even house
our new PhD students. How can we avoid dropping all these balls
without gaining space? And how can we move into new space most
effectively?
One model is to split up each group between two locations, so that
each maintains a presence among the others. The other is for one
group to move elsewhere. At the moment I think the second model
is far preferable, and so I tend to favor the alternative Ed brought
up at the last faculty meeting about moving HPP entirely to SRI.
That would give us enough breathing room until a better permanent
solution can be found.
-------
∂22-Oct-82 0918 Chappell at SRI-AI TODAY'S TINLUNCH
Date: 22 Oct 1982 0914-PDT
From: Chappell at SRI-AI
Subject: TODAY'S TINLUNCH
To: TINlunchers:
cc: chappell
From: Lauri Karttunen <Lauri at SRI-AI>
This Friday's Tinlunch speaker is Per-Kristian Halvorsen from the
Norwegian Research Council for the Humanities and the Center for
Cognitive Science at MIT, currently visiting at Xerox PARC. The talk
will be on his paper "Semantics for Lexical-Functional Grammar".
The author will be present. Time: 10:30. Place: EK242.
Papers for this TINLUNCH are on top of Elsie Chappell's file cabinet
EJ251. Jane Robinson will be presentating next week's (October 29)
TINLUNCH. The title of the paper is PARSING EFFICIENCY, COMPUTATIONAL
COMPLEXITY, AND THE EVALUATION OF GRAMMATICAL THEORIES, by Robert C.
Berwick and Amy S. Weinberg.
-------
∂22-Oct-82 1300 JMC*
Szeredi letter
∂22-Oct-82 1550 Andrei Broder <CSD.Broder at SU-SCORE> Next AFLB talks
Date: 22 Oct 1982 1227-PDT
From: Andrei Broder <CSD.Broder at SU-SCORE>
Subject: Next AFLB talks
To: aflb.all at SU-SCORE
cc: csd.dorio at SU-SCORE
Stanford-Office: MJH 325, Tel. (415) 497-1787
T H E N E X T A F L B - T A L Ks
10/28/82 Leo Guibas (Xerox) and Jorge Stolfi (Stanford):
"Representations for planar subdivisions and the computation of
Voronoi diagrams and Delaunay triangulations"
We will discuss the following problem: given n "data" points on the
plane, and an arbitrary "query" point q, find the data point that is
closest to q. This problem can be solved by constructing the Voronoi
diagram of the data points, and then locating the query point in one
of its regions. We will present some intersting properties of the
Voronoi diagram and of its dual, the Delaunay triangulation, and a
couple of algorithms for their construction. As the basis for all
this, we present a general data structure for representing planar
subdivisions and polyhedra.
******** Time and place: Oct. 28, 12:30pm in MJ352 (Bldg. 460) ********
11\4\1982 To be announced
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Regular AFLB meetings are on Thursdays, at 12:30pm, in MJ352 (Bldg.
460).
If you have a topic you would like to talk about in the AFLB seminar
please tell me. (csd.broder@score, MJH325, 497-1787) Contributions
are wanted and welcome. Not all time slots for this year have been
filled so far.
For more information about future AFLB meetings and topics you might
want to look at the file [SCORE]<csd.broder>aflb.bbboard.
-------
∂22-Oct-82 1626 CLT MTC and FORMAL SYSTEMS SEMINAR
To: "@MTC.DIS[1,CLT]" at SU-AI
TIME: Weds. October 27, 12noon to 1pm +
PLACE: Rm 252 Margaret Jacks Hall
SPEAKER: David Plaisted
SRI
TITLE: A Deductive Program Generation System
A method will be described for representing algorithms by proofs
in a natural deduction system. This representation yields a programming
language with a high degree of independence of machine and data structures.
This system permits composition, iteration, conditional, recursion, and
other common programming constructs to be conveniently expressed. Also,
the system has a natural way of combining programs into larger programs.
Correct proofs in the system correspond to correct programs. The system
can represent programs with multiple exits, nondeterminism, and errors
and exceptional conditions. We present extensions of the system to handle
nonterminating computations, fair nondeterminism, and concurrency. The
system will be compared with the existing logic programming languages
PROLOG, OBJ, Manna and Waldinger's system, and Goad's system.
∂23-Oct-82 1311 Jon Abbis <CSD.ABBIS at SU-SCORE> Advanced Phd Students for Annual Report
Date: 23 Oct 1982 1308-PDT
From: Jon Abbis <CSD.ABBIS at SU-SCORE>
Subject: Advanced Phd Students for Annual Report
To: CSD-Temp: ;
Stanford-Phone: (415) 497-9798
If you have any advanced Phd students working with you, please send me their
names and their dissertation titles. We need this information for the annual
report. Thank ou. -Jon
-------
∂23-Oct-82 1537 KAHN at USC-ISI Re: Wiederhold
Date: 23 Oct 1982 1536-PDT
Sender: KAHN at USC-ISI
Subject: Re: Wiederhold
From: KAHN at USC-ISI
To: JMC at SU-AI
Cc: kahn at USC-ISI, RPG at SU-AI
Message-ID: <[USC-ISI]23-Oct-82 15:36:00.KAHN>
In-Reply-To: Your message of 21 Oct 1982 1309-PDT
John,
Thats a surprise about gio. Suggest you put
a letter proposal together and ill see if i can get ron
to find some $ in his program to support the
commonlisp work. If he hasnt gotit, ill look
elsewhere.
Suggest you copy ron ohlander on the draft letter proposal.
bob
∂23-Oct-82 1723 JJW 206 homework
A couple of thoughts I had while you were assigning the problems on Thursday:
(1) For the program that eliminates common subexpressions, should the
test for equivalence of expressions just be (equal x y), or something
fancier, like considering ((lambda (x) (f x)) y) and (lambda (z) (f z)) y)
to be the same?
(2) The "extra credit" feature that Stuart Russell mentioned, i.e. recognizing
that (CAR (CDR X)) and (CADR X) are the same could be implemented by first
expanding all CADRs etc. in the input to CARs and CDRs and then using normal
methods.
(3) The input ((lambda (x) (x x)) (lambda (x) (x x))) should cause the
λ-conversion program to loop forever, and will do the same to the second if
it recognizes the equivalence of λ-expressions with different names of
bound variables. Is there a way of detecting this and should the students
be concerned with it?
The handout I am preparing is in HW3.TEX[206,JJW].
∂25-Oct-82 0922 OHLANDER at USC-ISI Common Lisp Support
Date: 25 Oct 1982 0917-PDT
Sender: OHLANDER at USC-ISI
Subject: Common Lisp Support
From: OHLANDER at USC-ISI
To: McCarthy at SU-AI
Cc: Kahn at USC-ISI, Adams at USC-ISI
Message-ID: <[USC-ISI]25-Oct-82 09:17:25.OHLANDER>
Prof. McCarthy,
Bob Kahn has come to me for my thoughts on your
proposed support of a Common Lisp effort at Stanford. I know
Dick Gabriel has been involved with the general Common Lisp work
that has gone on thus far and I have no qualms about his
competence or dedication. I have also talked with Raj Reddy and
Scott Fahlman and they believe that it would most likely be a
good thing if Dick Gabriel were to become more active in this
area, essentially taking over the leadership of the ad hoc Common
Lisp group. However, before launching a significant development
in implementing Common Lisp, refining it, and constructing
suitable tools for a rich environment, I would like to reach some
assessment as to how "common" Common Lisp is or is likely to be.
I believe that there is enormous benefit in reaching some
standardization within the MACLISP community. I also know that
there are many independent Lisp development efforts going on with
some tender egos involved.
Another concern that I have is that the Common Lisp language and
any tools that are developed for$ a programming environment have
as much portability as possible. We don't want to get the
intermingling of environment and language that has occurred in
Interlisp. This will require that certain user site dependent
functions, such as graphics, be kept isolated from the language
kernel.
I would appreciate your thoughts concerning these issues and your
opinion on whether and how we might develop a Common Lisp effort
that will serve as a major standard within the DARPA community.
Ron Ohlander
P.S. Dick Gabriel has proposed that we continue the Lisp timing
efforts. This is certainly no problem so$ far as time for
extension of effort$ is concerned because he is covered under
your contract. The little additional money that he requires is
not worth a contractual action. I would suggest that you examine
the existing contract to see if the travel can be covered.
∂25-Oct-82 1010 FFL
To: JMC, FFL
Reminder from Math-Sci office of Dr. Arrow's talk tomorrow night at
Ceras at 7:15.
∂25-Oct-82 1150 RPG ARPA
Take a look at ARPA.PRO[COM,LSP] which is a first draft of the
proposal Kahn and Ohlander have asked for. Make any changes you wish.
-rpg-
∂25-Oct-82 1810 BUCHANAN at SUMEX-AIM reprinting SAIL Memos
Date: 25 Oct 1982 1621-PDT
From: BUCHANAN at SUMEX-AIM
Subject: reprinting SAIL Memos
To: jmc at SU-AI
John,
the people at Comtex called and are very enthusiastic about reprinting
all the SAIL Memos in microfice form. They are willing to provide some
free online searching to the library in return for their help.
They would very much like you to write a 2-5 page introduction (or longer
if you wish) that puts the material in perspective. You are supposed to
have received a letter formally requesting it. In any case, they asked
me to check with you to see if you will be able to do it.
bgb
-------
∂25-Oct-82 1937 Paul Armer <CSD.ARMER at SU-SCORE> Tuesday Luncheon
Date: 25 Oct 1982 1529-PDT
From: Paul Armer <CSD.ARMER at SU-SCORE>
Subject: Tuesday Luncheon
To: CSD-Faculty: ;
Stanford-Phone: (415) 497-2906
Even though Gene is out of town, the usual Tuesday faculty luncheon
will be held at the regular time and place. Unless someone has a
more pressing topic, I'll discuss Hewlett Packard's new fellowship
program aimed at encouraging students to take up teaching upon
graduation. Paul
-------
∂26-Oct-82 0832 FFL
To: JMC, FFL
I have added the appointment with Philip Hilts to your calendar. Saturday,
OOct. 30, 11 a.m., in your office. 301 493 6494.
∂26-Oct-82 0944 Woody Bledsoe <ATP.Bledsoe at UTEXAS-20> Schedule at the AMS meeting.
Date: 26 Oct 1982 1130-CDT
From: Woody Bledsoe <ATP.Bledsoe at UTEXAS-20>
Subject: Schedule at the AMS meeting.
To: jmc at SU-AI
cc: ATP.Bledsoe at UTEXAS-20
John,
I am about to net mail the following message to the speakers
at the Special ATP Session, but before I do I would like to be sure
that you are happy with the position that we have placed you in the
program. I had originally thought that you would speak on Weds and
you can still do that if you want.
Please let me know soon. I'll send the revised schedule to the
other speakers on Thursday (Oct 28).
Woody
Program for The Automatic Theorem Proving Session at the Denver AMS Meeting
January 5-6, l983
SCHEDULE
The schedule is pretty well set now but it is still possible to
switch positions, one with another. (Until Nov 1, at which time Paul
Bateman of AMS will have to submit the final schedule.)
The Session on Proof Theory, organized by Irving Anellis (instead
of Don Monk) Will be held on Weds and Thurs Mornings, Jan 5-6, and
Paul Bateman has scheduled our meeting in the afternoons in order to
avoid conflits with them.
Please let me know if you have a strong preference for one date
over the other and I will try to accommodate you, but I must know this
by Monday Nov 1 at the latest.
Wednesday, Jan 5, 2:15 - 5:15
2:15 Donald Loveland (Brief Historical Overview of ATP)
20 min
2:45 Hoa Wang (milestone winner) 40 Min + 20 min break
Introduced by Martin Davis
3:45 Larry Wos (Wos and Winker, current winners) 40 Min + 20 min
(Open Questions Solved with the Assistance of AURA)
Introduced by Nils Nilsson
4:45 Bob Boyer (Automatically proving 20 Min + 10 min
theorems about recursive functions)
5:15 Doug Lenat (Automatic Conjecturing 20 Min + 10 min
in Mathematics)
5:45 Peter Andrews (Automating Higher Order Logic) 20 Min + 10 min
Thursday, Jan 6, 2:15 - 4:45
2:15 John McCarthy (Non Monotonic Reasoning 20 min + 10 min
and Common Sense Inference)
2:45 Derek Oppen (Decision procedures 20 min + 10 min
and/orComplexity in ATP, etc)
3:15 Dallas Lankford (Abelian Group Unification)
20 min + 10 min
3:45 Woody Bledsoe (Some Automatic Proofs in Analysis)
20 min + 10 min
4:15 Informal Discussion 20 min
This is the annual meeting of the American Mathematical
Society. The full AMS meeting runs Jan 5-9, l983.
The ATP Prize committee meets at noon Thursday, Jan 6.
W. Bledsoe
-------
∂26-Oct-82 1052 MLB Symbolics Lisp manuals
To: JJW
CC: JMC
The manuals are apparently back from the printers, and our Chatsworth
office wants to know how many additional boxes (16 manuals per box)
to ship to us for Stanford. On your previous estimate that you would
need about two boxes, I was able to negotiate a special price for you
of $12 per manual (the original number I got was $15). The procedure
should be: call Symbolics Palo Alto 494-8081 sometime SOON and inform
Jane Durrant or me how many boxes you want. When they arrive we'll
let you know. You can come over, sign for the manuals, sell them in
class on consignment and return the unsold manuals to us along with
the proceeds (the $12 includes tax, by the way).
∂26-Oct-82 1158 Nancy Dorio <CSD.DORIO at SU-SCORE> COLLOQUIUM NOTICE WEEK OF NOVEMBER 1 - 5, 1982
Date: 26 Oct 1982 1124-PDT
From: Nancy Dorio <CSD.DORIO at SU-SCORE>
Subject: COLLOQUIUM NOTICE WEEK OF NOVEMBER 1 - 5, 1982
To: colloq: ;
Stanford-Phone: (415) 497-2273
Date Place Person
Day Event From
Time Title
-------------------------------------------------------------------------------
11/1/82 Math 380C Andrew White
Monday Numerical Analysis Los Alamos National Laboratory
4:15 p.m. Seminar ``Compact as possible Difference Schemes for
Second Order Two Point Boundary Value Problems
on Nonuniform Meshes.''
11/2/82 MJ352 Dr. Edwin Alderman
Tuesday Medical Technology Stanford Medical Center
2:30 p.m. Research ``Applications of Computers in Cardiology''
11/3/82 MJ252 Speaker and title
Wednesday MTC \&\ FORMAL to be announced.
12:00 p.m SYSTEMS Seminar
11/3/82 Terman 153 John W. Hill
Wednesday Computer Systems Microbot Inc., Mountain View
4:15 p.m. Laboratory Seminar Title to be Announced
11/4/82 MJ352 Title and speaker
Thursday AFLB to be announced.
12:30 P.M
11/5/82 MJ352 Martin Kersten
Friday Database Research University of California, San Francisco
3:15 p.m. Seminar ``Troll - An optimistic Relational System?''
-------
∂26-Oct-82 1435 FFL
To: JMC, FFL
Duane Adams of ARPA called and wants to know if he can see you and
Dick Gabriel about LISP on Nov. 3. Pls. send a net reply to him.
∂26-Oct-82 2031 CLT
I'm going home to play my flute
∂27-Oct-82 1152 FFL
To: JMC, FFL
Philip Hilts office called to cancel the meeting with you for this
Saturday (I removed it from CAL) and asked to reschedule it for
November 13, Saturday, 11 a.m. (Added to your calendar)
∂27-Oct-82 1442 RPG Adams
It appears that I will be able to meet with Adams and you on wedneday
afterall.
-rpg-
∂27-Oct-82 1447 RPG If
we can meet in the morning that would be best for me, but
is not necessary.
-rpg-
∂28-Oct-82 0435 ADAMS at USC-ISI
Date: 28 Oct 1982 0431-PDT
Sender: ADAMS at USC-ISI
From: ADAMS at USC-ISI
To: JMC at SU-AI
Cc: adams at USC-ISI, RPG at SU-AI
Message-ID: <[USC-ISI]28-Oct-82 04:31:32.ADAMS>
In-Reply-To: Your message of 27 Oct 1982 1450-PDT
John,
11am of Wed sounds fine to me.
Duane
∂28-Oct-82 1008 Chappell at SRI-AI FRIDAY'S TINLUNCH
Date: 28 Oct 1982 1003-PDT
From: Chappell at SRI-AI
Subject: FRIDAY'S TINLUNCH
To: TINlunchers:
cc: chappell, navarro, ichiki
From: Jane Robinson
TINLUNCH will be held on Friday , October 29, 1982 in room EK242 at
lunchtime. The paper that will be discussed is
PARSING EFFICIENCY, COMPUTATIONAL COMPLEXITY, AND THE EVALUATION OF
GRAMMATICAL THEORIES
by
Robert C. Berwick & Amy S. Weinberg
The authors will not be present. Copies of this week's presentation
are on Elsie Chappell's file cabinet (EJ251). On Friday, November 5,
Fernando Pereira and David Warren will be presenting their paper
DEFINITE CLAUSE GRAMMARS FOR LANGUAGE ANALYSIS-A SURVEY OF THE
FORMALISM AND A COMPARISON WITH AUGMENTED TRANSITION NETWORKS.
Note: TINLUNCH will be on FRIDAY'S at noon.
-------
∂28-Oct-82 1156 Navarro at SRI-AI FUTURE TALKS
Date: 28 Oct 1982 1151-PDT
From: Navarro at SRI-AI
Subject: FUTURE TALKS
To: AIC-Associates:
Doug Lenat will give a talk on Monday, November 8, 1982 at 10:30 in
Conference Room EK242 on EURISKO and Fred Laken will give a talk on
November 10, 1982 at 10:30 in EK 242 on COMPUTING WITH GRAPHICS FORMS.
Abstracts to follow.
... Georgia
-------
∂28-Oct-82 1420 CL.BOYER at UTEXAS-20 Publication of LISP Conference Proceedings
Date: Thursday, 28 October 1982 16:13-CDT
From: CL.BOYER at UTEXAS-20
To: JMC at SU-AI
Subject: Publication of LISP Conference Proceedings
MIT Press seems positive towards the idea of publishing the
proceedings of the next LISP Conference, and I'm going to
write up a proposal for them unless you have any preliminary
objections to the idea.
I have no objections to M.I.T. Press
∂29-Oct-82 0955 Woody Bledsoe <ATP.Bledsoe at UTEXAS-20> Program for Denver Meeting
Date: 29 Oct 1982 0947-CDT
From: Woody Bledsoe <ATP.Bledsoe at UTEXAS-20>
Subject: Program for Denver Meeting
To: jmc at SU-AI, davism.acf1 at NYU, dwl.duke at UDEL-RELAY,
peter.andrews at CMU-10A, lenat at SU-AI, cl.boyer at UTEXAS-20,
oppen at PARC-MAXC, nilsson at SRI-AI
cc: ATP.Bledsoe at UTEXAS-20
Program for The Automatic Theorem Proving Session at the Denver AMS Meeting
January 5-6, l983
SCHEDULE
The schedule is pretty well set now but it is still possible to
switch positions, one with another. (Until Nov 1, at which time Paul
Bateman of AMS will have to submit the final schedule.)
The Session on Proof Theory, organized by Irving Anellis (instead
of Don Monk) Will be held on Weds and Thurs Mornings, Jan 5-6, and
Paul Bateman has scheduled our meeting in the afternoons in order to
avoid conflits with them.
Please let me know if you have a strong preference for one date
over the other and I will try to accommodate you, but I must know this
by Monday Nov 1 at the latest.
(Some titles are still missing or wrong - some of you have not yet sent
me a copy of your abstract)
Wednesday, Jan 5, 2:15 - 5:15
2:15 Donald Loveland (Brief Historical Overview of ATP)
20 min
2:45 Hoa Wang (milestone winner) 40 Min + 20 min break
Introduced by Martin Davis
3:45 Larry Wos (Wos and Winker, current winners) 40 Min + 20 min
(Open Questions Solved with the Assistance of AURA)
Introduced by Nils Nilsson
4:45 Bob Boyer (Automatically proving 20 Min + 10 min
theorems about recursive functions)
5:15 Doug Lenat (Automatic Conjecturing 20 Min + 10 min
in Mathematics)
5:45 Peter Andrews (Automating Higher Order Logic) 20 Min + 10 min
Thursday, Jan 6, 2:15 - 4:45
2:15 John McCarthy (Non Monotonic Reasoning 20 min + 10 min
and Common Sense Inference)
2:45 Derek Oppen (Decision procedures 20 min + 10 min
and/orComplexity in ATP, etc)
3:15 Dallas Lankford (Abelian Group Unification)
20 min + 10 min
3:45 Woody Bledsoe (Some Automatic Proofs in Analysis)
20 min + 10 min
4:15 Informal Discussion 20 min
This is the annual meeting of the American Mathematical
Society. The full AMS meeting runs Jan 5-9, l983.
The ATP Prize committee meets at noon Thursday, Jan 6.
W. Bledsoe
The people at AMS Headquarters mentioned that we might want
collect the papers from the ATP Spectial Session into a volume. Is there
any interest in doing that? I'm half inclined to do it you each of
you (or most of you) agree, because it would provide a look at ATP to the
mathematics community, without a lot of reading on their parts.
Also one is often asked for papers summarizing his talk after such a
session, so it is handy to have the papers (at least) to send out, and
also the whole set of papers in one volume. I would presume that each
speak would provide a slightly expanded version of his talk. (Or somewhat
longer version if he wanted).
I don't have all the details yet but will get them if
you show interest. AMS would publish the book if it approved by the
Contemporary Mathematics Editor (Prof James Milgram - Stanford) or
we could easily get someone else to publish it ,I believe. We can
get the AMS approval ahead of time if we go that route. Papers
for the AMS volumes usually run from 10 to 20 pages, but there is
a lot of leeway. Larry Wos and I like the idea.
-------
∂29-Oct-82 1331 Nancy Dorio <CSD.DORIO at SU-SCORE> CORRECTION TO COLLOQUIUM NOTICE WEEK OF NOVEMBER 1 - 5, 1982
Date: 29 Oct 1982 0956-PDT
From: Nancy Dorio <CSD.DORIO at SU-SCORE>
Subject: CORRECTION TO COLLOQUIUM NOTICE WEEK OF NOVEMBER 1 - 5, 1982
To: colloq: ;
Stanford-Phone: (415) 497-2273
Hopefully this will be the last of the corrections and addendums. Wishing
you all a Happy Halloween!
NanDate Place Person
Day Event From
Time Title
-------------------------------------------------------------------------------
11/2/82 Jordan 040 Professor Michael Genesereth
Tuesday Comuter Science Stanford University
4:15 p.m. Colloquium ``Meta-Level Programming''
-------
∂29-Oct-82 1400 CSCHMIDT at SUMEX-AIM Chaosnet is coming Monday!
Date: 29 Oct 1982 1357-PDT
From: CSCHMIDT at SUMEX-AIM
Subject: Chaosnet is coming Monday!
To: HPP-Lisp-Machines at SUMEX-AIM
Enough paper has finally been cleared out of the way to install the
Chaosnet. I expect the folks from Symbolics to start this Monday. They
expect to finish on Monday--but there are no guarantees.
Given the above, be advised that at some point Monday the LM-2 will
become unavailable (I don't yet know exactly when they'll arrive). When it's
ready for use again I'll send another note to this mailing list.
--Christopher
-------
∂29-Oct-82 1443 JK
To: JMC, JJW, JK
;what's below characterizes the current status of lisp definitions:
;what is missing is high order unification which would have avoided
;the explicit passage from coll to collect and defintions of defsexp and atomcase.
;the current set of axioms can be found in lispax.cmd[ekl,jk]
;note how meta theory is replaced by high order unification and variables
;of list type (in this case pars). In this way many definition schemata can
;be expressed in the current language.
(get-proofs lispax)
(proof collect)
;(show sexpinductiondef)
;labels: SEXPINDUCTIONDEF
;27. (AXIOM
; |∀ATOMCASE DEFSEXP.(∃FUN.(∀PARS X.FUN(X,PARS)=
; (IF ATOM X THEN ATOMCASE(X,PARS)
; ELSE DEFSEXP(X,FUN(CAR X,PARS),
; FUN(CDR X,PARS),
; PARS))))|)
;
(define coll
|∀pars x.(IF ATOM X THEN coll(X,pars)=LIST(X)
ELSE coll(X,pars)=coll(CAR X,pars)*coll(CDR X,pars))|
(use sexpinductiondef
(ue: (atomcase.|λx pars.list x|) (defsexp.|λx gr1 gr2 pars.gr1*gr2|))))
(label colldef)
(define collect |∀gr.collect(gr)=coll(gr,nil)|)
(label collectdef)
(trw |∀x.(IF ATOM X THEN collect(X)=LIST(X)
ELSE collect(X)=collect(CAR X)*collect(CDR X))|
((use collectdef t) (use colldef )))
∀X.(IF ATOM X THEN COLLECT(X)=LIST(X)
ELSE COLLECT(X)=COLLECT(CAR X)*COLLECT(CDR X))
∂30-Oct-82 1308 Betty Scott <CSD.BSCOTT at SU-SCORE> Secretary
Date: 30 Oct 1982 1305-PDT
From: Betty Scott <CSD.BSCOTT at SU-SCORE>
Subject: Secretary
To: JMC at SU-AI, ZM at SU-AI
cc: CSD.Yearwood at SU-SCORE, MAS at SU-AI, CSD.BScott at SU-SCORE
We have several applications for Fran's replacement. We expect that inter-
views will be completed by the end of next week (we can't make an offer
to anyone until Monday, November 8). John, we will let you know as soon
as we have a pool of applicants determined, and will arrange interview
times with you.
In the meantime, Marianne Siroker has offered to help John with anything
he has which must be done, and also to help the new secretary to get started
on SAIL. Phyllis Winkler is helping Zohar with his letters, etc. Marlie
Yearwood and I will take care of financial matters.
Please let me know if problems develop, or if you need special help with
anything. I will do my best to see that everything goes as smoothly as
possible.
Betty
-------
∂30-Oct-82 1621 Gene Golub <CSD.GOLUB at SU-SCORE> Lunch on Tuesday
Date: 30 Oct 1982 1615-PDT
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: Lunch on Tuesday
To: faculty at SU-SCORE
Chris Papadimitriou will be at our lunch on Tuesday. As you may know he
is being considered for a joint position between CS and OR.
GENE
-------
∂30-Oct-82 1622 Gene Golub <CSD.GOLUB at SU-SCORE> Tenured Faculty Meeting
Date: 30 Oct 1982 1623-PDT
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: Tenured Faculty Meeting
To: CSD-Tenured-Faculty: ;
We will be meeting on Thursday at 2:30 in the Conference room next to
my office. We will be voting on the Papadimitriou appointment. I have
sent the letters on him to each of the full-professors. If you are unable
to attend the meeting, please let me know your vote.
GENE
-------
∂31-Oct-82 1124 Feigenbaum at SUMEX-AIM CMU/IBM workstation plan (retransmission)
Date: 31 Oct 1982 1124-PST
From: Feigenbaum at SUMEX-AIM
Subject: CMU/IBM workstation plan (retransmission)
To: kahn at USC-ISI, jmc at SU-AI, dek at SU-AI
The following are the news release and semi-technical backgrounder
on Carnegie-Mellon University's plans for a distributed personal
computing network which will be developed with IBM.
--David I. Lewin <LEWIN at CMU-20C>
Dir. of Science & Technology Information
Dept. of Public Relations
CMU
Contact: Don Hale For release: 1 p.m., Wednesday,
Carnegie-Mellon and IBM Sign
Joint Development Contract
PITTSBURGH--A prototype distributive computing project designed to
give every student at Carnegie-Mellon University direct personal
access to the full information resources of the university will be
developed jointly by CMU and International Business Machines
Corporation (IBM).
Dr. Richard M. Cyert, president of Carnegie-Mellon, said the goal of
the three-year agreement signed today is to lay the technological
foundation, in equipment and programming, for powerful computer
workstations and communications services to be available to students
and faculty, whether at home in an office or in a laboratory. The
development effort will build on existing software research done by
the CMU Department of Computer Science.
By 1986, several thousand personal workstations for the university's
staff, faculty and 5,500 students will be in place, CMU officials
predict.
"The comprehensive computing environment planned by the university
differs greatly from the traditional way computer facilities have
been used in higher education," Dr. Cyert said.
"For example, in 1991, we expect to have about 7,500 personal
workstations, each with its own powerful computer and graphics
display, all interconnected through a high-speed local area network.
In addition to communications between every workstation, there will
be a unified data file system and a central computing facility
available to all workstations.
"Our objective is to extend this computing system and supporting
network for faculty and students beyond the CMU campus to the
greater Pittsburgh area through cable television or telephone
lines," he said.
The agreement with IBM, which involves a commitment through a
three-year development phase, calls for the establishment of an
Information Technology Center (ITC) at the university. It will be
staffed by both IBM and CMU personnel. The agreement also expresses
the intent of IBM to continue its support through 1987, based on
progress of the project.
IBM will provide funds and equipment for the ITC. IBM and CMU
personnel will work together at the center to develop the
programming for the prototype computing environment.
"Carnegie-Mellon is aware that it now costs more than $10,000
annually for someone to attend college," Dr. Cyert said. "We want to
provide students with a competitive edge, and this is the next step
in meeting the challenges of the future.
"The university remains committed to a financial aid policy that
makes it possible for any qualified student to attend the
university."
"Carnegie-Mellon is an appropriate campus for this prototype
computing environment because it is a leader in computer science and
technological innovation," said Dr. Lewis Branscomb, IBM vice
president and chief scientist. "The university is large enough to
test this concept in all disciplines, yet small enough to make the
test economically feasible."
The agreement with IBM provides for the establishment of a
consortium of universities, with each university designating a
person as primary liaison with the CMU-IBM project. Regular meetings
of these designated individuals will be held and, as elements of the
integrated computing environment become operational, they may be
made available to members of the consortium.
###
←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←
Carnegie-Mellon University's Personal Computing Environment
The personal computing environment at Carnegie-Mellon University
will be implemented in two stages, a two-year transition phase
introducing personal workstations into the CMU computing
environment, and an advanced phase, introducing a distributed
computing environment.
To get experience in working with personal workstations, a
substantial number of existing machines will be brought into the
Carnegie-Mellon computing environment over the next two years. These
transition machines will be linked to the current computing
facilities.
Currently under evaluation as the transition machine is a
workstation with a 16-bit (Motorola 68000) processor and a
bit-mapped graphic display, manufactured by the IBM Instruments
Division. Initially, over a hundred transition machines are
expected to be available on campus in the fall of 1983, growing to
several hundred in following years. Software, including an editor
and text processing facilities, will be developed at the
Carnegie-Mellon Computation Center to function in an environment
based on the UNIXtm operating system. It is expected that FORTRAN,
Pascal and the C programming languages will be supported.
While the transition system is implemented and evaluated, work will
be in progress within the joint CMU-IBM Information Technology
Center on software for the second phase of the university's personal
computing plan. During the transition period, IBM will work on
networking and advanced workstations.
Carnegie-Mellon's objective is to begin deploying the computing
environment resulting from integrating all these elements, including
a new operating system environment for distributed personal
computing, in late 1985.
The workstations will have a 32-bit processor with virtual memory
capable of executing 0.5-1 million instructions per second (MIPS),
from 500,000 to 1 millions bytes of random access memory, a
high-resolution bit-mapped graphics display, and a graphics tablet
and keyboard input. Both an on-board disc memory and color display
will be options.
Rather than using built-in disc storage, clusters of 50 to 100
workstations will share a file server through a local area network;
the clusters will be linked together--and to the university's
mainframe computers--through a backbone network. Users will be able
to access files from any workstation in the network.
---------------
-------
∂31-Oct-82 1758 KAHN at USC-ISI Re: CMU/IBM workstation plan (retransmission)
Date: 31 Oct 1982 1754-PST
Sender: KAHN at USC-ISI
Subject: Re: CMU/IBM workstation plan (retransmission)
From: KAHN at USC-ISI
To: Feigenbaum at SUMEX-AIM
Cc: kahn at USC-ISI, jmc at SU-AI, dek at SU-AI
Message-ID: <[USC-ISI]31-Oct-82 17:54:43.KAHN>
In-Reply-To: Your message of 31 Oct 1982 1124-PST
Ed,
Thanks for the writeup on the CMU/IBM plan. Its helpful to have
it in machine readable form.
Actually, I was at CMU the day that the press conference was held
and listened to part of it. A small group of us had lunch with
cyert just before the event and that was actually a far better
way to learn about their plans and motivations.
CMU is clearly excited about the collaboration and given IBM's
recent discovery of the PC area, it could just work out extremely
well. I guess we'll all be watching it develop with much
interest.
My guess is that the sun terminals will have more capability than
the transitional ibm machines (which also use 68000's) but the
801 based machine (the follow-on) could be more powerful. They
plan to use the accent kernel developed for the spice/dsn
project, bt its not clear how much more of the spice software
will eventually get into the system.
bob
∂01-Nov-82 0957 Bob Moore <BMOORE at SRI-AI> Talk on Comparatives
Date: 1 Nov 1982 0927-PST
From: Bob Moore <BMOORE at SRI-AI>
Subject: Talk on Comparatives
To: AIC-Associates: ;
cc: stucky at SRI-AI, bresnan at PARC-MAXC, kaplan at PARC-MAXC
I have been doing some work on the semantics of the comparative construction
in English. I will be giving a talk about it this Thursday, Nov. 4, at
10:30 AM in EK242.
--Bob
-------
∂01-Nov-82 2033 Feigenbaum at SUMEX-AIM visit by Alpha-Omega Steering group
Date: 1 Nov 1982 2030-PST
From: Feigenbaum at SUMEX-AIM
Subject: visit by Alpha-Omega Steering group
To: hpp-exec at SUMEX-AIM
cc: jmc at SU-AI, delagi at SUMEX-AIM
Alpha-Omega is one of the working groups of the Microelectronics and
Computer Technology industrial consortium. This embryonic consortium
(CDC,DEC, Honeywell, and one or two other companies--hopefully more later)
plans an ambitious research program on next-generation architectures,
especially those pointing toward knowledge processing machines.
The steering committee is currently considering where to locate a
research center. Stanford or the Stanford-area seems like a good place.
The steering committee will be coming out to discuss this with key people
among us on Monday Nov. 8. I'll find out more about times tomorrow, and
will let you know by message. Hold some blocks of time open for Monday
for a group meeting.
Ed
-------
∂01-Nov-82 2031 Andrei Broder <CSD.Broder at SU-SCORE> Next AFLB talks
Date: 31 Oct 1982 1635-PST
From: Andrei Broder <CSD.Broder at SU-SCORE>
Subject: Next AFLB talks
To: aflb.all at SU-SCORE
cc: csd.dorio at SU-SCORE
Stanford-Office: MJH 325, Tel. (415) 497-1787
T H E N E X T A F L B - T A L Ks
11/4/82 Ken Clarkson (Stanford):
"Megiddo's linear programming algorithm"
Nimrod Megiddo of Tel Aviv University has recently devised a linear
programming algorithm for which the number of arithmetic operations
performed is linear in the number of constraints. In contrast,
Khachian's algorithm has a complexity dependent on the sum of the
logarithms of the coefficients, and so is more dependent on the
particular number encoding used than is Megiddo's algorithm. The
approach used by Megiddo can be extended to quadratic programming, and
in particular, to the "minimum spanning sphere" problem of
computational geometry. The resulting O(n) algorithm beats the
previous best O(n log n) algorithm for the planar case, and the O(n↑2)
algorithm for dimensions greater than 2. In this talk, I will sketch
the approach used in developing these algorithms.
******** Time and place: Nov. 4, 12:30pm in MJ352 (Bldg. 460) ********
11/11/82 Prof. Stephen Smale (Berkeley):
"Average case analysis of the simplex algorithm"
No abstract available.
******** Time and place: Nov. 11, 12:30pm in MJ352 (Bldg. 460) ********
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Regular AFLB meetings are on Thursdays, at 12:30pm, in MJ352 (Bldg.
460).
If you have a topic you would like to talk about in the AFLB seminar
please tell me. (csd.broder@score, MJH325, 497-1787) Contributions
are wanted and welcome. Not all time slots for this year have been
filled so far.
For more information about future AFLB meetings and topics you might
want to look at the file [SCORE]<csd.broder>aflb.bbboard.
-------
∂02-Nov-82 1019 KAHN at USC-ISI comments on balzer msg??
Date: 2 Nov 1982 1017-PST
Sender: KAHN at USC-ISI
Subject: comments on balzer msg??
Subject: [BALZER at USC-ISIF: FYI]
From: KAHN at USC-ISI
To: jmc at SU-AI
Message-ID: <[USC-ISI] 2-Nov-82 10:17:57.KAHN>
john,
Would you care to comment on the above msg from Bob Balzer?
bob
Begin forwarded message
Mail-From: ARPANET host USC-ISIF rcvd at 25-Oct-82 1058-PDT
Date: 25 Oct 1982 1053-PDT
From: BALZER at USC-ISIF
To: KAHN at USC-ISI
Subject: FYI
Date: 25 Oct 1982 1045-PDT
From: BALZER at USC-ISIF
Subject: LISP COMPATIBILITY
To: ADAMS at USC-ISI
cc: OHLANDER at USC-ISI, LYNCH, BALZER
DUANE,
I UNDERSTAND THROUGH DAN THAT YOU ARE QUITE INTERESTED IN ENDING THE DIVERSITY
THAT EXISTS AMONG THE VARIOUS LISP DIALECTS AND OF YOUR PLAN TO ENLIST
MCCARTHY'S SUPPORT.
WHILE I SHARE THIS OBJECTIVE WITH YOU AND BELIEVE THAT MCCARTHY'S SUPPORT WOULD
BE HELPFUL, I'M CONCERNED THAT ANY TOP-DOWN APPROACH WILL FAIL BECAUSE OF THE
TREMENDOUS INERTIA INVOLVED IN THIS AREA. THIS INERTIA ARRISES FROM:
1. BODIES OF EXISTING CODE
2. IMPLEMENTATION AVAILABILITY(INCLUDING HARDWARE PRICE/PERFORMANCE)
3. EXPERIENCE
4. RELIGIOUS CONVICTION
WHAT THE COMMUNITY NEEDS IS A FAMILY OF MACHINES WHICH RUN COMPATIBLE LISP
SYSTEMS RANGING FROM (AFFORDABLE) PERSONAL MACHINES TO MUCH MORE POWERFUL
SHARED (PROBABLY SEQUENTIALLY) LISP SERVERS. IT SEEMS CLEAR THAT LONG TERM
THE AFFORDABLE PERSONAL MACHINES MUST COME FROM THE XEROX'S, HP'S, DEC'S,
AND IBM'S OF THE WORLD WHO ARE PRODUCING VAST QUANTITIES OF SOME POWERFUL
PERSONAL MACHINE WHICH JUST HAPPENS TO RUN LISP, AND THAT THE HIGH-END
LISP SERVERS MUST COME FROM THE SYMBOLICS AND LMI'S OF THE WORLD WHO BUILD
SPECIAL PURPOSE ENGINES FOR THIS SPECIFIC HIGH PERFORMANCE TASK. THE
SMALL SPECIALIZED COMPANIES CANNOT COMPETE WITH THE ECONOMIES OF SCALE THAT
THE BIG MANUFACTURERS GET FROM PIGGY-BACKING ON GENERAL PURPOSE PERSONAL
MACHINES. NOR CAN THE BIG MANUFACTURERS RESPOND TO THE LIMITED MARKET FOR
"SUPER" LISP SERVERS.
WE ARE REASONABLY CLOSE TO SATISFYING THIS FAMILY NEED THROUGH THE XEROX
DANDILION AND THE SYMBOLICS 3600, EXCEPT FOR THE OVERWHELMING PROBLEM THAT
THEY DON'T RUN COMPATIBLE LISPS. I THINK MOST OF THE LISP RESEARCH COMMUNITY
WOULD FIND SUCH A COMBINATION OF PERSONAL AND SERVER LISP MACHINES VERY
ATTRACTIVE.
FURTHERMORE, I BELIEVE THAT THE BEST STRATEGY FOR ENDING THE DIVERSITY AMONG
THE VARIOUS LISP DIALECTS IS TO UTILIZE THE ATTRACTIVENESS OF A DANDILION/3600
COMBINATION TO JUSTIFY A "BOTTOM-UP" APPROACH OF MAKING LISP-MACHINE LISP
AND INTERLISP COMPATIBLE, OR AT LEAST COMPATIBLE ENOUGH SO THAT THESE
MACHINES ARE INTEROPERABLE (I.E. PROGRAMS BEING DEVELOPED COULD BE MOVED
BACK AND FORTH BETWEEN THESE MACHINES FOR FURTHER DEVELOPMENT AND/OR USE).
THIS OPTION IS ATTRACTIVE ENOUGH THAT WE ARE PUSHING SYMBOLICS VERY HARD
TO EXTEND THE ALREADY QUITE SUCCESSFUL COMPATIBILITY PACKAGE, AND ARE PLANING
TO AUGMENT THEIR EFFORTS WITH SOME OF OUR OWN. PERHAPS, XEROX CAN BE
PERSUADED TO FOLLOW AN ANALOGOUS APPROACH.
MUCH COMPATIBILITY NOW EXISTS AT THE PROGRAM LEVEL. THE MAJOR EXCEPTION IS
THE WINDOW PACKAGE. IN ADDITION, A REMOTE GRAPHICS PROTOCOL NEEDS TO BE BUILT
SO THAT LISP SERVERS CAN EMPLOY GRAPHICS/WINDOWS THROUGH DEDICATED PERSONAL
MACHINES(I.E. THE USERS ONLY HAVE ONE TERMINAL IN THEIR OFFICE). BEYOND THE
PROGRAM COMPATIBILITY AREA IS THE INTEGRATION OF "ENVIORNMENT" CAPABILITIES.
HERE, BECAUSE PEOPLE RATHER THAN PROGRAMS ARE THE MAIN(BUT NOT ONLY) USERS,
EQUIVALENT CAPABILITIES RATHER THAN COMPATIBILITY IS MOST CRUCIAL.
I WOULD SUGGEST THAT IPTO HELP FORM AN APPROPRIATE GROUP OF USERS AND VENDORS
TO FORMULATE A PLAN FOR ENABLING THIS INTEROPERABLITY. PERHAPS ISI CAN/SHOULD
PLAY A MAJOR ROLE IN BOTH FORMULATING SUCH A PLAN AND CARRING IT OUT.
REGARDS,
BOB
-------
-------
--------------------
End forwarded message
∂02-Nov-82 1045 CSCHMIDT at SUMEX-AIM Chaosnet
Date: 2 Nov 1982 1044-PST
From: CSCHMIDT at SUMEX-AIM
Subject: Chaosnet
To: HPP-Lisp-Machines at SUMEX-AIM
As many of you probably noticed, the Chaosnet was not installed
yesterday. Symbolics did not get the software from MIT because MIT had
a big VAX crash. Or so the story goes.
Symbolics hopes to be able to install the Chaosnet tomorrow, however.
This will depend upon MIT and Federal Express, or whoever their courier is.
The installation will entail about an hour of downtime for the
LM-2 and Diablo. All efforts will be made to minimize the downtime required.
--Christopher
-------
∂02-Nov-82 1049 JK dd in mj360
To: ME, REG, JMC
Since my dd has now been out of order for the past few weeks with seemingly
no immediate fix in sight I would like to suggest a temporary repair that
might make at least my life somewhat more convenient: I notice that there
are a few unused dd lines around (for example, there is one in 302).
Would it be possible to switch my dd lines with one of these at least until
the underlying problem is fixed.?
∂02-Nov-82 1347 BUCHANAN at SUMEX-AIM Re: visit by Alpha-Omega Steering group
Date: 2 Nov 1982 1343-PST
From: BUCHANAN at SUMEX-AIM
Subject: Re: visit by Alpha-Omega Steering group
To: Feigenbaum at SUMEX-AIM
cc: hpp-exec at SUMEX-AIM, jmc at SU-AI, delagi at SUMEX-AIM
In-Reply-To: Your message of 1-Nov-82 2030-PST
I'll be at the IBM mtg with Mike on Nov.8.
bgb
-------
∂02-Nov-82 1400 Chappell at SRI-AI Doug Lenat's Visit - November 8,1982
Date: 2 Nov 1982 1355-PST
From: Chappell at SRI-AI
Subject: Doug Lenat's Visit - November 8,1982
To: AIC-Associates:
cc: dberson, csd.lenat at SU-SCORE, chappell
From: LENAT at PARC-MAXC
Subject: Abstract for my talk
To: CHAPPELL at SRI-AI
cc: CSD.LENAT at SCORE
Date: November 8, 1982
Time: 10:30 AM
Place: EK242
EURISKO: Further work in Learning by Discovery
Douglas B. Lenat, Stanford Heuristic Programming Project
The AM program, an early attempt to mechanize learning by discovery,
has recently been expanded and extended to several other task domains.
AM's ultimate failure apparently was due to its inability to discover
new, powerful, domain-specific heuristics for the various new fields
it uncovered. At that time, it seemed straight-forward to simply add
"Heuristics" as one more field in which to let AM explore, observe,
define, and develop. That task -- learning new heuristics by
discovery -- turned out to be much more difficult than was realized
initially, and we have just now achieved some successes at it. Along
the way, it became clearer why AM had succeeded in the first place,
and why it was so difficult to use the same paradigm to discover new
heuristics. The new program, Eurisko, has been applied to eight task
domains: design of naval fleets, elementary set theory and number
theory, Lisp programming, biological evolution, games in general, the
design of three-dimensional VLSI devices, the discovery of heuristics
which help the system discover heuristics, and the discovery of
appropriate new types of "slots" in each domain. Along the way, some
very powerful new concepts, designs, and heuristics were indeed
discovered mechanically. Characteristics that make a domain ripe for
AM-like exploration for new concepts and conjectures are explicated,
plus features that make a domain especially suitable for Eurisko-level
exploration for new heuristics.
-------
∂02-Nov-82 1632 Kanerva at SUMEX-AIM TVEDIT with large character set
Date: 2 Nov 1982 1631-PST
From: Kanerva at SUMEX-AIM
Subject: TVEDIT with large character set
To: McCarthy at SU-AI
When we talked about this over a month ago, I felt that you did not
think it was that important to see the letter alpha on the screen rather
than "\alpha". Perhaps not in mathematical text, but I had also wanted
people to be able to write French and Spanish and Russian, and of course
Finnish, and there it does seem to matter. Best wishes. - Pentti
-------
I did think it was important and still do, especially in mathematics.
∂02-Nov-82 1657 Marlene Yearwood <CSD.YEARWOOD at SU-SCORE> [The Mailer Daemon <Mailer at SU-SCORE>: Message of 2-Nov-82 16:08:51]
Date: 2 Nov 1982 1655-PST
From: Marlene Yearwood <CSD.YEARWOOD at SU-SCORE>
Subject: [The Mailer Daemon <Mailer at SU-SCORE>: Message of 2-Nov-82 16:08:51]
To: jmc at SU-AI
Stanford-Phone: (415) 497-6622
Date: 2 Nov 1982 1631-PST
From: The Mailer Daemon <Mailer at SU-SCORE>
To: CSD.YEARWOOD at SU-SCORE
Subject: Message of 2-Nov-82 16:08:51
Message failed for the following:
csd.jmc at SU-AI: 450 Unrecognized MAIL recipient.
------------
Date: 2 Nov 1982 1608-PST
From: Marlene Yearwood <CSD.YEARWOOD at SU-SCORE>
Subject: Interviews for Fran's Replacement
To: csd.jmc at SU-AI
Stanford-Phone: (415) 497-6622
I have two or three possible candidates for the position
and would like to schedule interviews with you tomorrow
afternoon and/or Thursday morning. Please let me know
when it would be convenient for you so I can call them and
set up interviews. Thanks. marlie
-------
-------
-------
Tomorrow afternoon after 2pm would be ok.
∂02-Nov-82 1701 JJW Exam
I believe the midterm is still too long. After removing two of the
programming problems, which left 3 programs and 2 proofs (one problem
falling in both categories), I tried taking it. Most was straight-
forward, except for the expression simplifier. After about 15 minutes, I
was still not through with expressions containing just PLUS, and hadn't
yet started the cases involving TIMES. I would estimate that some people
might need well over an hour to do this one. So I think it should be
replaced with a simpler problem.
Some people have asked me about the final exam. Have you decided whether
it will be a take-home like last year? If so, announcing that now would
help people in their planning, especially some of the T.V. students.
∂02-Nov-82 2342 RPG
∂02-Nov-82 2253 JMC How's this for a reply to Kahn?
I changed a few things and amended some punctuation to get the following.
I'm not sure what `fragmentation' you are referring to in the last
paragraph, but I assume that it is the fragmentation that Common Lisp
is attempting to reverse.
∂03-Nov-82 0100 RPG
∂03-Nov-82 0058 JMC
It's balzer.rep[f82,jmc]. Modify it if you want.
Seems fine.
∂03-Nov-82 0955 Bob Moore <BMOORE at SRI-AI> Time change for comparatives talk
Date: 3 Nov 1982 0927-PST
From: Bob Moore <BMOORE at SRI-AI>
Subject: Time change for comparatives talk
To: AIC-Associates: ;
cc: stucky at SRI-AI, bresnan at PARC-MAXC, kaplan at PARC-MAXC
Due to a number of schedule conflicts, I am changing the time for my talk
on the semantics of comparatives to 3:00 PM on Monday, Nov. 8. The talk
will still be in EK242.
--Bob
-------
∂03-Nov-82 1131 ML
John,
The following is a thesis proposal that might be of some
interest to you. Can we set up a meeting to discuss it in the
near term future?
Thanks,
Mike Lowry
Thesis proposal on Learning in the Domain of Geometric Computation
------------------------------------------------------------------
Engineering Problem:
The AI community has focused much of its efforts on heuristic
search at the expense of developing good representations. When representations
have been discussed, it has often been at the level of data structures-
that is semantic nets versus units versus formulas versus procedural encodings
versus production rules. While data structures are important, they are
essentially implementation decisions that are one level below the
epistemological decisions (JMC).
My proposeal is to work on a system that explicitly chooses
among mathematical formalisms to represent a problem stated abstractly.
For examle, problems will be stated in abstract geometric terms, and the
system will decide whether to retain the abstract geometric formulation
or reformulate the problem in analytic terms to apply algebraic methods.
In order to carry out this decision, it will need to represent the
different mathematical formalisms explicitly and the reasons for
choosing among them.
Many dimensions differentiate novice from expert performance.
Perhaps 2 of the most important dimensions differentiating novice from
expert are choosing appropriate representations of a problem and making
appropriate use of simplifying assumptions. When a knowledge engineer
constructs an expert system, he implicitly encodes decisions regarding
representations and simplifying assumptions. I propose to make these
decisions explicit to the system itself, so that the system can dynamically
modify the representations and the simplifying assumptions it uses, based
upon monitoring performance and a limited degree of analysis. I propose to
do this in a domain where these issues are clear cut and success can be
expected to yield large increases in expert system performance. The
domain is that of applying linear algebra and analytic geometry to
problems in vision and robotics. Representation choice means decisions
regarding mathematical formalisms (e.g. co-ordinate system).
Simplifying assumptions means additional constraints or assumptions to
the problem statement to facilitate problem solution.
Specific Domain: the domain of 3-D geometry is rich in representations and
the relationships between representations.
By different representations I mean different
mathematical formalisms, such as cartesian, cylindrical, or spherical
co-ordinate systems; or different ways of representing rotations.
Many algorithms are exponential
or worse on the length of the problem statement, so that an appropriate
choice of representation often makes the difference between a tractable
and intractable problem.
For similar reasons using simplifying assumptions (such as deciding that
a particular factor is negligible and can be ignored) and meta-planning
with more abstract representations can make intractable problems
solvable.
This domain is also interesting because there are many special cases
which turn out to be surprisingly useful and general when applied to
task problems in vision or robotics. Caching these special cases can
yield huge savings in computation time.
In this proposal I will be using examples from the current Acronym
system. One interesting component, currently the bottleneck in terms
of computation time, is the constraint system. THe constraint system
is a partial decision procedure on the satisfiablility of systems of
non-linear inequalities (quadratic terms, trigonemtric functions).
Scientific Issues Addressed:
1. What methods can be used by a program to dynamically choose an
appropriate representation for a problem? Everyone knows that
a good representation is far more important than powerful search
techniques in making a problem tractable, but little AI work has
been done in representation choice. I believe that choosing
an appropriate mathematical formalism in a mathematical domain
rich in alternative interrelated mathematical formalisms is a
a tractable, though not trivial, problem suitable for exploring
representation choice.
2. Simplifying assumptions often make a problem more tractable.
One example is dropping terms that can be predicted to be
negligible, another example is making the assumption of
non-singularity (such as general position). Simplifying
assumptions are a limited form of abstraction, in fact
approptiate abstractions might be found by dynamically
monitoring simplifying assumptions. Simplifying assumptions
are used extensively, not only in mathematics but in planning,
programming, circuit design, etc. I hypothesize that one major
difference between a novice and an expert is the latter's use
of appropriate simplifying assumptions. There are 2 issues here:
a. Representing a simpilfying assumption so that it can be used
in further processing. The fact that a simplifying assumption
has been made often restricts the manipulations that can be
performed, and which simplifying assumptions can be made later.
Thus it is not sufficient to merely make the simplifying
assumption and then forget about it.
b. How can a program learn which simplifying assumptions are
appropriate and pay off?
3. Caching and expectation filtering should help identify those
singularities that are useful, and perhaps can form the primitives
of a new representations. (e.g. orthogonal vectors are unusual,
in that their dot product is zero, and can be used to form a
representation of a vector space).
Input/Output Behavior
---------------------
The system, which I shall call ISIS, will begain with a sparse
but complete representation of mathematics up through geometry, algebra,
and linear algebra (vector spaces). It will also have procedures for
algebraic manipulation and linear algebra. A large part of its power
will come from specializing and generalizing mathematical concepts, and
the functions defined on the mathematical formalisms. However, instead
of simply carrying out inductive search, it will be able to prove
properties of new concepts by carrying out symbolic computations on
the subomponents of the concepts (see Scenarios). I will also give
it enough initial knowledge to decide upon the satisfiability of
systems of constraints, though decisions about normal form and
appropriate simplifications will be left to ISIS.
ISIS will then be given a series of problems in the domain
of computer vision and robotics. FOr example, it might be asked to
find kinematic equations for robot arms- that is given the joint
angles, determine the hand position. The procedure for doing this is
rather straightforward, but many short cuts exist as a consequence of
special configurations. In the process of computing and then analysing
the kinematic equations, ISIS will learn the short cuts much as an
expert does. Representations of rotations, and appropriate choice of
co-ordinate systems are very useful in simplifying the kinematic equations.
As another example, ISIS might be asked to determine whether a particular
scene could be an instantiation of a given 3-D model. This would be
an exercise of its constraint system, and it would have to decide
what normal form to use and which simplifying assumptions to make.
ISIS will combine analysis and induction from examples
into a powerful learning methodology. Since many of the algorithms are
highly recursive, often exponential, efficient representations and
monitoring of programs should yield dramatic increases in the speed
with which ISIS carries out its task.
Scenarios
---------
1. Given a representation of 3-D rotations as a 4x4 matrix
or linear transformation, then it should discover
that each rotation has a unique axis which does not
change position under rotation (i.e. its an
eigenvector). A method for constructing representations
is to define a new representation using a unique
individuating property of another representation.
Thus ISIS should also learn to represent rotations
as an axis and an angle. Note that this is a powerful
semantic method of constructing a new representation, as
opposed to a weak syntactic method.
2. A useful property of rotations is that the set of rotations
about the orthogonal axis of angles that are multiples of
90 degrees form a group. Many objects have right angle bends
that meet this criteria, and computing their kinematic
equations are greatly simplified by making use of the
rotation group just described. This group might plausibly
be hypothesized, then identified, in the course of
working out some examples (making use of the representation
of rotations discussed in scenario 1).
3. One problem with the constraint system of Acronym is that
a large amount of time is spent normalizing previously
normalized subexpressions when combining them into a
larger expression. However, because of non-linearities
such as variables multiplied togeather, it is possible that
a normalized sub-expression will need to be renormalized
when combined into a larger expression (for example, assumptions
might be made about the signs of variables). Because of the
large amount of time spent in normalizing expressions, it
would pay off to be more sophisticated when deciding whether
to renormalize or not. The same mechanisms that could decide
whether an expression is normalized with respect to a certain
set of assumptions is also exactly what is needed to keep
track of simplifying assumptions in general.
ISIS could detect the large amount of time spent on renormalizing
through expectation filtering and self-monitoring. First,
it would not expect that a simplified expression would be
EQUAL (in lisp sense) to the unsimplified expression. That
they would be EQUAL in many cases would violate expectations.
The fact that large amounts of time are spent on simplifying
expressions that are already simplified would make it a high
priority task to try to determine when an expression is simplified
or not. Analysis and generalization of working through particular
examples should yield sufficient conditions.
MileStones
----------
1. Several scenarios explored in enough detail to elucidate the
principles of representation choice and carrying through
information about assumptions into later stages of processing.
Also elucidate those particular problems in the domain of
3-D geometric computation will be particularily fruitfull to
explore.
2. A set of principles, such as that a new representation can
be formed out of an identifying property of a previous
representation, should be formulated both for choosing
and learning representations and carrying through information
about simplifying assumptions. These principles should be
debugged with further hand examples.
3. ISIS should be programmed, probably within or as an extension
to Eurisko, and demonstrated on some toy examples.
4. ISIS should be applied to real problems in computational
geometry, vision, and robotics.
My Goals
--------
My major reasearh interest lies in goal oriented systems that
learn within the context of a task domain. I am most interested in
semantic learning as opposed to parameter tweaking or syntactic
manipulation. This research interest can be rephrased as expert
systems which improve their performance while doing their tasks.
∂03-Nov-82 1310 Gene Golub <GHG at SU-AI> lunches
Mail-from: ARPANET site SU-AI rcvd at 3-Nov-82 1237-PST
Date: 03 Nov 1982 0920-PST
From: Gene Golub <GHG at SU-AI>
Subject: lunches
To: faculty at SU-SCORE
CC: GHG at SU-AI
Yesterday's lunch was a mixed bag. I gather Papadimitriou didn't realise
that the lunch was for the entire faculty and that he was expected to
perform. Furthermore he was pretty tired from jet lag.
I did enjoy Ed Feigenbaum's comments. I thought we were at the begin-
ning of an interesting conversation when our guest arrived. I would
like to see more simple discussions; it was good that Ed discussed the
TIME article. My only regret was that we didn't use the discussion to
talk more about encoding schemes.
Why the lunches? I thought this would be a good way for the faculty
to have casual conversations, hopefully leading to better interactions.
Then too I felt this would be a good way to bring around visitors who
might want to casually meet members of the faculty. Some of our
discussions have been good, others dull.
Next wek Jerry Lieberman will be joining us and on Nov 23, Bob Spinrad.
i have some specific issues I'd like to talk about eg admissions, faculty
responsibilities but that can wait.
So I would like to continue the lunches for this quarter. Should we
have them go on next year? Do you feel they are of any use?
Let me know how you feel about this.
GENE$
∂03-Nov-82 1523 Chappell at SRI-AI Friday's TINLUNCH
Date: 3 Nov 1982 1518-PST
From: Chappell at SRI-AI
Subject: Friday's TINLUNCH
To: TINlunchers:
cc: chappell
From: Daniel Sagalowicz
TINLUNCH will be held on Friday November 5, 1982 in EK242 at
lunchtime. The paper that will be discussed is
DEFINITE CLAUSE GRAMMARS FOR LANGUAGE ANALYSIS-A SURVEY OF THE
FORMALISM AND A COMPARISON WITH AUGMENTED TRANSITION NETWORKS
BY
Fernando Pereira and David Warren
The authors will be present. Copies of this week's presentation
are on Elsie Chappell's file cabinet (EJ251). On Friday, November 12,
Stuart Shieber will be presenting PARENTHETICALS AND DISCONTINOUS
CONSTITUENT STRUCTURE by James D. McCawley. The author will not be present.
Note: TINLUNCH will be on FRIDAY'S at noon.
-------
∂03-Nov-82 1537 Tom Binford <TOB at SU-AI>
Mail-from: ARPANET site SU-AI rcvd at 3-Nov-82 1351-PST
Date: 03 Nov 1982 1349-PST
From: Tom Binford <TOB at SU-AI>
To: GHG at SU-AI
Remailed-date: 3 Nov 1982 1501-PST
Remailed-from: Gene Golub <CSD.GOLUB at SU-SCORE>
Remailed-to: faculty at SU-SCORE
Gene
I strongly favor having lunches next year and beyond. I look forward
to the chance to meet other faculty and talk about joint interests,
e.g. VAX and SUN software, and projects. It has been useful to find
out about things like equipment buys, etc.
I have enjoyed meetings as they are. I would not like lunch
meetings to be an extension of faculty meetings, nor to be too heavily
programmed.
Tom
∂03-Nov-82 1552 CLT i
am off to the dentist then home
∂03-Nov-82 1731 P. Cheeseman <cheeseman at SRI-AI> Probabilistic Inference Talk
Date: 3 Nov 1982 1651-PST
From: P. Cheeseman <cheeseman at SRI-AI>
Subject: Probabilistic Inference Talk
To: AIC-Associates: ;
A seminar entitled:
"A Method for Computing Probabilities for Expert Systems"
will be presemted by Peter Cheeseman,
on Thursday, November 11th. at 10:30 a.m. in EK242.
ABSTRACT
--------
Various methods used in expert systems for computing the probability
of hypotheses of interest given specific information, will be reviewed.
Only PROSPECTOR type reasoning is justified on probabilitic grounds, provided
the strong assumption of conditional independence is made. If this assumption
does not fit the available information, then the only general method for
computing any conditional probability is that of Maximum Entropy (alternatively
called the method of Least Information). The Maximum Entropy value for a
particular conditional probability will be shown to be the only choise that
does not assume information not inherent in the problem statement. In addition
to computing the value of any desired conditional probability, the Maximum
Entropy method can be used to measure how accurately the calculated value is
known. The use of the Maximum Entropy method in expert systems was suggested
by Kurt Konolige, who also provided a method for computing Maximum Entropy
values. Unfortunately, his method (and similar methods by other authors) is
combinatorially explosive, thus limiting its use. A new method will be
presented which usually avoids this combinatorial explosion, allowing the
Maximum Entropy approach to be used on realistic problems.
-------
∂03-Nov-82 1752 Gene Golub <CSD.GOLUB at SU-SCORE> Meeting on Thursday, Nov4
Date: 3 Nov 1982 1750-PST
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: Meeting on Thursday, Nov4
To: CSD-Tenured-Faculty: ;
Just a reminder that we will be meeting on Thursday, Nov 4
at 2:30 in the conference room next to my office. The main
topic of discussion is the appointment of Chris Papadimitriou.
GENE
-------
∂03-Nov-82 1908 Nancy Dorio <CSD.DORIO at SU-SCORE> COLLOQUIUM NOTICE WEEK OF NOVEMBER 8 - 12, 1982
Date: 3 Nov 1982 1627-PST
From: Nancy Dorio <CSD.DORIO at SU-SCORE>
Subject: COLLOQUIUM NOTICE WEEK OF NOVEMBER 8 - 12, 1982
To: colloq: ;
Stanford-Phone: (415) 497-2273
Date Place Person
Day Event From
Time Title
-------------------------------------------------------------------------------
11/8/82 MJ252 Tom Binford, Oussama Khatib, Raja Chatilla
Monday Robotics Seminar Stanford University
4 p.m. ``Robotics in France''
11/8/82 Math 380C Franklin Luk
Monday Numerical Analysis Cornell University
4:15 p.m. Seminar ``A Systolic Architecture for the Singular Value
Decomposition''
11/9/82 MJ352 Mr. John Kunz
Tuesday Medical Computing Stanford University
1:30 p.m. Journal club ``Recent Articles of Interest''
11/9/82 MJ352 Dr. Allen Ream
Tuesday Medical Technology Stanford Medical Center
2:30 p.m. Research Seminar ``Intra-Operative Evaluation of the Heart by
Computer''
11/9/82 Jordan 040 Mr. Andreas Bechtolsheim
Tuesday Computer Science Stanford University
4:15 p.m. Colloquium ``The Sun Workstation''
11/10/82 MJ416 Professor John McDermott
Wednesday HPP Guest Seminar Carnegie-Mellon University
3:30 p.m. ``CMU Style Expert Systems''
11/10/82 MJ252 To be announced
Wednesday MTC \&\ FORMAL
12 p.m. SYSTEMS Seminar ``Lively discussion of deductive program
synthesis. Logic programming and related
issues''
11/10/82 Terman Auditorium Doug Clark
Wednesday Computer Systems DEC/Tewksbury, Mass.
4:15 p.m. Laboratory To be Announced
11/11/82 MJ352 Professor Stephen Smale
Thursday AFLB Berkeley
12:30 p.m ``Average Case Analysis of the Simplex
Algorithm''
11/12/82 MJ352 David Hsiao
Friday Database Research Naval Postgraduate School, Monterey
3:15 p.m. Seminar ``Database Computers''
-------
∂03-Nov-82 2125 CLT SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
To: "@DIS.DIS[1,CLT]" at SU-AI
Speaker: Dr. J. A. Goguen, SRI International
Time: Monday, November 8, 3:30-5:00
Place: Room 383N Math. Bldg.
INSTITUTIONS:
Abstract Model Theory and Program Specification
by J. A. Goguen and R. M. Burstall
SRI International and University of Edinburgh
An INSTITUTION is a collection of SIGNATURES (which are vocabularies for
constructing sentences) together with for each signature SIG: the set of all
SIG-sentences; the category of all SIG-models; and a SIG-satisfaction
relationship between sentences and models, such that when signatures are
changed (with a signature morphism), satisfaction is preserved. Examples
include first order logic (with and without equality), equational logic, Horn
clause logic, and (presumably) higher order logic, infinitary logic, and modal
logic, as well as many other less standard systems. We show how certain parts
of logic can be conducted in the setting of an arbitrary institution. For
example, if an institution has signatures that can be glued together (with
colimits), then its THEORIES (which are just sets of sentences with the same
signature) can also be glued together. Another result is that any LIBERAL
institution (an institution having free models) can be extended to another
institution whose sentences may include declarations of freedom for
subtheories. A third result shows that a sound institution morphism permits a
theorem prover for one institution to be used on the sentences of another. We
will also discuss applications of these results to the specification of
computer programs, showing that much of this subject is independent of the
underlying institution.
∂03-Nov-82 2247 Feigenbaum at SUMEX-AIM retransmission
Date: 3 Nov 1982 2245-PST
From: Feigenbaum at SUMEX-AIM
Subject: retransmission
To: hpp-exec at SUMEX-AIM, jmc at SU-AI, tob at SU-AI, rww at SU-AI,
csd.ullman at SU-SCORE
Date: 3 Nov 1982 2243-PST
From: Feigenbaum
Subject: visit of Alpha-Omega working group on Monday 11/8
To: hpp-exec@SUMEX-AIM, jmc@SAIL, tob@SAIL, rww@SAIL, delagi,
To: csd.ullman@SCORE, feigenbaum
(I'll resend this message to the systems faculty as soon as I look up their
various electronic addresses)
As I reported in my previous message, a working group from the Alpha-Omega
committee of the MCC (industry consortium for long range research) will be here
on Monday 11/8, starting at 9am in MJH 252. Gordon Bell (DEC), Tom Gannon (CDC),
and others will come. Tom says they would like to hear about, and discuss,
work in:
a. Artificial Intelligence and Knowledge-based Expert Systems
including work on AI applied to VLSI design and work on advanced software
development environments
b. ideas abut dta base models; ideas about new machine architectures related
to (a) above.
c. ideas related to high-speed parallel computation, whether related to (a)
above or not.
d. work related to human interfaces
particularly graphics interfaces, computer vision (i.e. show the machine
a picture) and computer speech understanding and generation.
Based on conversations with various faculty, I'm arranging this schedule,:
Starting at 9am, talks by Feigenbaum (on Stanford work in Expert Systems
generally), by Harold Brown on the AI-in-VLSI work (note: Harold, your 30
minute CIS talk will be fine; please ask Mark Stefik to come if he can),
by Bruce Delagi (summarizing work of AI Architectures group),
by Gordon Novak (on the GEV graphics environment for GLISP), by John
McCarthy on his complex of AI interests including his views of AI's
"technology future" over the next decade, and Tom Binford (computer vision
research). These talks+discussion should each last about 30-40 minutes
maximum, but if you have a need for less time than that, that's fine.
That brings us to lunch, which will be in MJH 352, and then we stay there
for the remainder of the day.
At 1:15pm, Doug Lenat will talk about heuristics-for-discovery research, with
application to microcircuit discovery.
From 2 to 5, various systems faculty (to be organized by Hennessy, I think)
will give presentations about parallel computation, graphics stations and
network graphics research, etc., with Ullman coming at 4:30 to talk about
parallel-algorithms-theory. All of this in MJH 352.
I'll be unreachable until I read my electornic mail on Sunday night, so I hope
there are no questions that cant wait until the last minute.
Those who get this message but who are not on the list of speakers should
not feel obligated to come, but are welcome if they wish to come. Lunch will
be served to all.
Ed
-------
-------
∂04-Nov-82 1124 REITER at RUTGERS reply to your message
Date: 2 Nov 1982 1235-EST
From: REITER at RUTGERS
Subject: reply to your message
To: JMC at SU-AI
cc: reiter at RUTGERS
Dear John,
Sorry for my delay in replying to your message but I have been swamped
with work lately and I wanted to give your questions some thought. I still
haven't found enough time but at least I can answer one of your questions:
Office tel. no. (201)932-2082
Home tel. no. (212)Home tel. no. (212)788-2531
I do have some vague ideas arising from database theory about circumscri-
bing disjunctions and I'll get back to you on them. I'd like to see your
solution to the Tale of Two Cities. Can you handle the "Nixon paradox"?
The typical Quaker is a pacifist.
The typical Republican is not a pacifist.
Suppose Richard is a Quaker Republican.
It seems to me that one should draw no conclusions re his warlike nature.
There are other examples of this kind in my IJCAI-81 paper if you
want to kill some time some evening.
Best wishes,
Ray
-------
∂05-Nov-82 0828 Chappell at SRI-AI November 8th Visit
Date: 5 Nov 1982 0829-PST
From: Chappell at SRI-AI
Subject: November 8th Visit
To: AIC-Associates:
cc: CHAPPELL
From: LENAT at PARC-MAXC
Subject: Abstract for my talk
To: CHAPPELL at SRI-AI
cc: CSD.LENAT at SCORE
Date: November 8, 1982
Time: 10:30 AM
Place: EK242
EURISKO: Further work in Learning by Discovery
Douglas B. Lenat, Stanford Heuristic Programming Project
The AM program, an early attempt to mechanize learning by discovery,
has recently been expanded and extended to several other task domains.
AM's ultimate failure apparently was due to its inability to discover
new, powerful, domain-specific heuristics for the various new fields
it uncovered. At that time, it seemed straight-forward to simply add
"Heuristics" as one more field in which to let AM explore, observe,
define, and develop. That task -- learning new heuristics by
discovery -- turned out to be much more difficult than was realized
initially, and we have just now achieved some successes at it. Along
the way, it became clearer why AM had succeeded in the first place,
and why it was so difficult to use the same paradigm to discover new
heuristics. The new program, Eurisko, has been applied to eight task
domains: design of naval fleets, elementary set theory and number
theory, Lisp programming, biological evolution, games in general, the
design of three-dimensional VLSI devices, the discovery of heuristics
which help the system discover heuristics, and the discovery of
appropriate new types of "slots" in each domain. Along the way, some
very powerful new concepts, designs, and heuristics were indeed
discovered mechanically. Characteristics that make a domain ripe for
AM-like exploration for new concepts and conjectures are explicated,
plus features that make a domain especially suitable for Eurisko-level
exploration for new heuristics.
-------
∂05-Nov-82 0900 Gene Golub <CSD.GOLUB at SU-SCORE> Our talk and misc
Date: 5 Nov 1982 0856-PST
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: Our talk and misc
To: quate at SU-SCORE
cc: CSD.GOLUB at SU-SCORE
I have talked to Feigenbaum and he would agree to move providing
8000 square feet were made available to him in Jordan quad. I think it
is unfair to his group and to our department to have them split into
two parts and to have them outside Jacks Hall.
I did not enjoy the adversarial nature of our discussion. It seems that
our department is being penalized for being so good! We are lacking
space, slots and teaching assistant funds. Instead of helping us, your
office seems to want to punish us. There are plenty of weak departments
at Stanford for you to be concerned about. We feel our appointments
have been as strong as any in the University. Let's remember that several
departments that were excellent have greatly declined. I believe our
department has a sensible plan that would prevent this and your office
should be of assistance in implementing it.
GENE GOLUB
-------
∂05-Nov-82 0930 Marlene Yearwood <CSD.YEARWOOD at SU-SCORE> Last Interview
Date: 5 Nov 1982 0928-PST
From: Marlene Yearwood <CSD.YEARWOOD at SU-SCORE>
Subject: Last Interview
To: jmc at SU-AI
cc: : ;
Stanford-Phone: (415) 497-6622
Maribel Calderon, the 5 p.m. yesterday, is unable to come back
until Tuesday. Do you want to wait and interview her then, or
do you want to make a decision from those you have already
interviewed? The other possibility, of course, is starting
the search over again.
I need to call Ms. Calderon back today to let her know your
decision. Thanks. marlie
-------
Please have her come on Tuesday. I want to look further than those
I have so far interviewed. Sorry about yesterday.
∂05-Nov-82 1027 CSCHMIDT at SUMEX-AIM Chaosnet progress report
Date: 5 Nov 1982 1027-PST
From: CSCHMIDT at SUMEX-AIM
Subject: Chaosnet progress report
To: HPP-Lisp-Machines at SUMEX-AIM
Two people from Symbolics worked with Erik Hedberg yesterday afternoon
and well into the evening on getting the Chaosnet up. Problems with
integrating the Chaosnet board into the VAX are now the sticking point.
Work will recommence later this morning.
--Christopher
-------
∂05-Nov-82 1055 DCL Lisp history and manuscript
To: gxg at SRI-KL, HST at SUMEX-AIM
CC: JMC at SU-AI
To: Herbert Stoyan.
I have been unable to get SUMEX to accept NET mail for you.
Where are you and whats your phone no?
I have received nothing from John McCarthy on your LIsp history manuscript.
So I am not able to comment on it. John?
- David
∂05-Nov-82 1109 Nancy Dorio <CSD.DORIO at SU-SCORE> pmessage
Date: 5 Nov 1982 1108-PST
From: Nancy Dorio <CSD.DORIO at SU-SCORE>
Subject: pmessage
To: jmc at SU-AI
Stanford-Phone: (415) 497-2273
John Cocke called from IBM in reference to a project for Art Samuel.
He asks for you to call him at this number 914/945-2150. He says he has
it all arranged for Art.
Nan
-------
∂05-Nov-82 1204 Carolyn Tajnai <CSD.TAJNAI at SU-SCORE> Forum speakers
Date: 5 Nov 1982 1202-PST
From: Carolyn Tajnai <CSD.TAJNAI at SU-SCORE>
Subject: Forum speakers
To: DEK at SU-AI, JMC at SU-AI
Do either of you have a student ready to speak at the Forum meeting
Feb. 3/4?
Please advise.
Carolyn
-------
∂05-Nov-82 1437 Marlene Yearwood <CSD.YEARWOOD at SU-SCORE> Interview on Tuesday
Date: 5 Nov 1982 1438-PST
From: Marlene Yearwood <CSD.YEARWOOD at SU-SCORE>
Subject: Interview on Tuesday
To: jmc at SU-AI
Stanford-Phone: (415) 497-6622
Ms. Calderon could not make it at 5 p.m., but could make it at
ll:30 a.m. Please let me know if that is agreeable with your
schedule. Thanks. marlie
-------
11:30 Tuesday is ok.
∂05-Nov-82 1803 CLT MTC and FORMAL SYSTEMS SEMINAR
To: "@MTC.DIS[1,CLT]" at SU-AI
TIME: Weds. November 10, 12noon to 1pm +
PLACE: Rm 252 Margaret Jacks Hall
EVENT: Lively Discussion of deductive program synthesis,
logic programming and related issues.
We have heard presentations of Richard Waldinger and David Plaisted
on systems for deductive program synthesis.
This seminar will begin with brief presentions by
Chris Goad on the main ideas of his thesis work
``Computational Uses of the Manipulation of Formal Proofs''
Carolyn Talcott on some issues in logic programming in general
and PROLOG and related systems in particular.
and possibly others.
aimed at providing a few more facts and provoking discussion.
Bring your ideas, opinions, complaints, examples, counter-examples, etc.!
∂07-Nov-82 0852 CLT
if you will please tell me what you would like done, i will try to do it
∂07-Nov-82 1545 KAHN at USC-ISI
Date: 7 Nov 1982 1541-PST
Sender: KAHN at USC-ISI
From: KAHN at USC-ISI
To: JMC at SU-AI
Cc: kahn at USC-ISI
Message-ID: <[USC-ISI] 7-Nov-82 15:41:22.KAHN>
In-Reply-To: Your message of 03 Nov 1982 0828-PST
John,
thanks for your comments on balzers msg. Do you think it would
be appropriate to share your comments with balzer or
would you prefer not to?
If he hasnt done so already, i suspect ron ohlander will
be asking you for a letter proposal to add the common lisp
task (assuming i can find the $ that is - which i think i can).
bob
I have no objections to your forwarding my message to Balzer.
I talked to Tom Rindfleisch and Ed Feigenbaum about the attitude
of HPP to Common Lisp. Their view is hopeful but still somewhat
skeptical that the divergent interests will come together. No
objections to the proposed content of Common Lisp were expressed,
and this seems to augur well for the acceptance of Common Lisp
if the coalition holds together long enough to finish it. As I
said before, this looks hopeful. We'll get the letter proposal
in as soon as we hear from Ron.
∂07-Nov-82 1606 CLT
i am going to play duets, back by 7ish
∂08-Nov-82 0939 Gene Golub <CSD.GOLUB at SU-SCORE> Forsythe Lectures
Date: 8 Nov 1982 0931-PST
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: Forsythe Lectures
To: faculty at SU-SCORE
As you may recall, we have decided to invite our former graduates
to give the Forsythe Lectures. This academic year Raj Reddy will
give the lectures at the end of January, 1983. Please send me
nominations for speakers for January 1984! A list of our 196 graduates
can be seen in STD:Alumni.Pty.
GENE
-------
∂08-Nov-82 0945 barwise@Uwisc (Jon Barwise) transfinite chess
Date: 8 Nov 1982 11:16:03-CST
From: barwise@Uwisc (Jon Barwise)
Reply-to: barwise@Uwisc
To: jmc@su-ai
Subject: transfinite chess
It was a topic of math lounge discussions some years ago here.
The only thing I know published on it is in a review I wrote of
Moschovakis book "Elementary Induction on Abstract Structures"
in the Bulletin of the Amer Math Society, 1975. I give an example
there of a transfinite win for white.
How are things?
∂08-Nov-82 0956 Gene Golub <CSD.GOLUB at SU-SCORE> Lunch with Lieberman
Date: 8 Nov 1982 0944-PST
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: Lunch with Lieberman
To: Faculty at SU-SCORE
Tomorrow (11/9/82) Jerry Lieberman will be at our lunch. In view of
the negative view of the Dean's office to the department, I think we
ought to make the department's problems very clear to Jerry. Try to come
with some thoughtful questions. GENE
-------
∂08-Nov-82 1005 RPG SL
Ralph and Marty discontinued SL. This severely cramps my
ability to use this machine. Can we do something about it?
-rpg-
∂08-Nov-82 1002 RPG
∂06-Nov-82 1816 JMC
I forgot what you said about when SCHEME will again be available.
I have to do a lot of FTPing, first from OZ to MC, and then to here.
I will get to it in the next 3 days.
-rpg-
∂08-Nov-82 1046 JJW EKL manual
I left a copy of the EKL manual on your desk. If you want any changes,
please tell me; then I'll make an index and send it to the copiers. I'm
not sure if they'll have it ready by tomorrow afternoon, but I'll try to
get it then if possible.
∂08-Nov-82 1047 JJW Fran's mail
Some mail has been piling up in Fran Larson's mailbox downstairs. I picked
out stuff sent for CS 206 from the TV network, but there are other things
there, some of which may be important.
∂08-Nov-82 1052 Paul Armer <CSD.ARMER at SU-SCORE> Comp Comm
Date: 8 Nov 1982 1048-PST
From: Paul Armer <CSD.ARMER at SU-SCORE>
Subject: Comp Comm
To: jmc at SU-AI
Stanford-Phone: (415) 497-2906
If we were to want to appoint someone from among your research associates
to the comprehensive committee to represent the MTC area, who would you
recommend?? Paul
-------
∂08-Nov-82 1311 RPG
And ARPA.PRO[COM,LSP]
∂08-Nov-82 0653 OHLANDER at USC-ISI Stanford Common Lisp Effort
Date: 8 Nov 1982 0648-PST
Sender: OHLANDER at USC-ISI
Subject: Stanford Common Lisp Effort
Subject: [OHLANDER at USC-ISI: Common Lisp Support]
From: OHLANDER at USC-ISI
To: Gabriel at SU-AI
Message-ID: <[USC-ISI] 8-Nov-82 06:48:14.OHLANDER>
Dick,
I have received no response from McCarthy on the net note
shown below so I am forwarding it to you in the hope of
generating a response. I know that McCarthy has been talking to
Kahn directly but Bob is not going to undertake this effort
unless I support it. My real concern with what you are proposing
is just how it fits in with the larger context of achieving a
standardized Common Lisp. I believe that Common Lisp could be a
great thing for the community but I feel that any individual
effort undertaken in this area must come within some overall
objectives that we have to set for ourselves. Just where do the
various implementations of Common Lisp stand right now? What do
we want to eventually produce in the way of Common Lisp language
and environment? How should we proceed to that end? Who are the
dedicated supporters of a Common Lisp Effort at this time? Is
the establishment of a library the next logical thing to do? I
would appreciate it if you can get back to me on some of these
issues. We might then be able to map out some kind of tentative
plan as to how we might proceed. I can pay a visit out there
next month to nail down something.
Ron
Begin forwarded message
Mail-From: ADAMS created at 8-Nov-82 05:10:37
Date: 25 Oct 1982 0917-PDT
From: OHLANDER at USC-ISI
To: McCarthy at SU-AI
Cc: Kahn at USC-ISI, Adams at USC-ISI
Subject: Common Lisp Support
Message-ID: <[USC-ISI]25-Oct-82 09:17:25.OHLANDER>
Sender: OHLANDER at USC-ISI
Redistributed-To: Ohlander at USC-ISI
Redistributed-By: ADAMS at USC-ISI
Redistributed-Date: 8 Nov 1982
Prof. McCarthy,
Bob Kahn has come to me for my thoughts on your
proposed support of a Common Lisp effort at Stanford. I know
Dick Gabriel has been involved with the general Common Lisp work
that has gone on thus far and I have no qualms about his
competence or dedication. I have also talked with Raj Reddy and
Scott Fahlman and they believe that it would most likely be a
good thing if Dick Gabriel were to become more active in this
area, essentially taking over the leadership of the ad hoc Common
Lisp group. However, before launching a significant development
in implementing Common Lisp, refining it, and constructing
suitable tools for a rich environment, I would like to reach some
assessment as to how "common" Common Lisp is or is likely to be.
I believe that there is enormous benefit in reaching some
standardization within the MACLISP community. I also know that
there are many independent Lisp development efforts going on with
some tender egos involved.
Another concern that I have is that the Common Lisp language and
any tools that are developed for$ a programming environment have
as much portability as possible. We don't want to get the
intermingling of environment and language that has occurred in
Interlisp. This will require that certain user site dependent
functions, such as graphics, be kept isolated from the language
kernel.
I would appreciate your thoughts concerning these issues and your
opinion on whether and how we might develop a Common Lisp effort
that will serve as a major standard within the DARPA community.
Ron Ohlander
P.S. Dick Gabriel has proposed that we continue the Lisp timing
efforts. This is certainly no problem so$ far as time for
extension of effort$ is concerned because he is covered under
your contract. The little additional money that he requires is
not worth a contractual action. I would suggest that you examine
the existing contract to see if the travel can be covered.
--------------------
End forwarded message
∂08-Nov-82 1359 CSCHMIDT at SUMEX-AIM Chaosnet progress report
Date: 8 Nov 1982 1357-PST
From: CSCHMIDT at SUMEX-AIM
Subject: Chaosnet progress report
To: HPP-Lisp-Machines at SUMEX-AIM
The physical chaosnet is now installed and the modifications to the
unix kernal are complete (we believe). Convolutions in the way dipswitches
are labelled on the chaosnet board led us to a false start last Friday.
In order to minimize inconvenience to the Diablo user community, we will
try to start up the chaosnet during tomorrow's PM. Hopefully it will work
perfectly, but as always, there are no guarantees.
--Christopher
-------
∂08-Nov-82 1444 Chappell at SRI-AI William (Bill) Mann's Visit
Date: 8 Nov 1982 1445-PST
From: Chappell at SRI-AI
Subject: William (Bill) Mann's Visit
To: AIC-Associates:
TO: AIC.Associates
WHEN: November 15, 1982
TIME: 10:30AM
PLACE: EK242
GUEST: WILLIAM (BILL) MANN
TOPIC: The Nigel Text-Generation Grammar
ABSTRACT
The Nigel Text-Generation Grammar
William Mann
USC/ISI
A programmed grammar of English has been created as part of a
research text generation system. This grammar, called Nigel,
includes a programmed expression of the Systemic framework
(independent of English), a large grammar of English, and a
programmed expression of the semantic demands which the grammar
places on its environment, including the text planner and the
knowledge representation.
The talk will describe all of these, concentrating on the
grammatical framework and the semantics.
-------
-------
∂08-Nov-82 1526 DCL Lisp History
John,
Have you a manuscript of whats-his-names on LISP history?
He sent me a msg. sometime ago that you were supposed to pass
such a thing onto me.
- David
∂08-Nov-82 1555 Paul Armer <CSD.ARMER at SU-SCORE> Dinner with Raj Reddy
Date: 8 Nov 1982 1535-PST
From: Paul Armer <CSD.ARMER at SU-SCORE>
Subject: Dinner with Raj Reddy
To: CSD-Faculty: ;
Stanford-Phone: (415) 497-2906
Circle Thursday, January 27, 1983 on your calendars for a dinner with
Raj Reddy, this year's George and Sandra Forsythe lecturer. More details
later but do reserve the date.
Paul
-------
∂08-Nov-82 2328 HST via SUMEX-AIM lisp history manuscript
To: JMC
CC: DCL
david reporest me that he didnt receive the translated lisp history pages
could you be so kind and transfer them to him? thank you.h.stoyan
∂08-Nov-82 2337 Gene Golub <CSD.GOLUB at SU-SCORE> [Calvin Quate <ICL.QUATE at SU-SCORE>: Deanery]
Date: 8 Nov 1982 2329-PST
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: [Calvin Quate <ICL.QUATE at SU-SCORE>: Deanery]
To: CSD-Tenured-Faculty: ;
Here is an exchange between Quate and myself. GENE
---------------
1) 8-Nov Calvin Quate Deanery
2) 8-Nov To: ICL.QUATE at SU- Re: Deanery
Message 1 -- ************************
Mail-From: ICL.QUATE created at 8-Nov-82 16:57:02
Date: 8 Nov 1982 1657-PST
From: Calvin Quate <ICL.QUATE at SU-SCORE>
Subject: Deanery
To: CSD.GOLUB at SU-SCORE
cc: ICL.QUATE at SU-SCORE
Gene:
I read my electronic mail again over the weekend and I can understand how
you came away from our last meeting with the impressions as you state them.
Allow me to respond.
I understand that Computer Science is an important component in the University
and it is growing in importance. The rating of 5.0 in the recent rating sheet
is quite unique. We , in the Dean's Office, syhhould position ourselves in such
a way that we can be of help.
But, in several areas our response has not led to a solution where we thought
a solution was possible. The space problem is a critical one where we have
spent a great deal of time. We are aware of the crowding in Margaret Jacks
Hall. We were faced with the move of HPP to SRI. Our solution was to offer
space jin Jorin Jordan Quad and Welch Road. But as it turns out this was not a solution since HPP prefers to stay in Margaret Jacks.
In another instance, we turned to the problem of increasing the billet count
in Computer Scienece. We jknew there were billets in the Provost's Office,knew therand we were able to persuade Hastorf toa assign a billet in su7ppport of yourn needs in systems and White's needs in C ISIS. When I read in Knuth's memo
"....if Papdimitriou accepts our offer ...." I assumed that it was the
Systems/CIS billet. I was unaware of the proposeal to offer him a joint
appointment with OR and this may have been the source of concern that you
perceived in our last meeting.
I know that you are unfcomfortable with some of the procedures that we
insist upon in the Dean's Office, but as you know, they have evolved over
a period of time and it is unlikely that we will be able to change them
on a time scale that will be of use to you and your group.
-------
Message 2 -- ************************
Mail-From: CSD.GOLUB created at 8-Nov-82 23:20:19
Date: 8 Nov 1982 2320-PST
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: Re: Deanery
To: ICL.QUATE at SU-SCORE
In-Reply-To: Your message of 8-Nov-82 1657-PST
Thank you for your response. I guess we were both taken aback at our
last meeting. As you might guess I was quite surprised to hear I could
see you in ten minutes or in two weeks. I hardly had time to gather my
papers or my thoughts together.
In Rosse's memo to me he authorised our department to make three searches.
He apparently had no misgivings about our parallel processing. He also
stated we could come back to the Dean's office if we had an outstanding
candidate. Since his memo we have had appointed Mayr and Yao; the Genesereth
appointment is still pending. In addition Baskett has resigned and Schreiber
has been served notice that he won't be re-appointed beyond '83-'84.
When Veinott approached me about the Papadimitriou appointment in late
summer I felt we had not filled up our billets . Unfortunately it was
not possible to get to your office then.
I have tried to inform you of this possible appointment but I guess I
wasn't very clear, possibly because I wasn't sure of all the details.
At any rate I will bring you the Papadimitriou papers when you return.
This will be against the Baskett slot which was a 1/2 billet, not
the new CS/EE billet. I hope my lack of protocol will not prejudice
this case. I think Papadimitriou is a super appointment and he will
make a substantial contribution to both departments.
I hope we can discuss the possibilties of new slots for CS. Since
1974 the slot count has gone from 13.25 to 15.05; one new slot was
added when Knuth received a chair! At Cornell five new slots have
been added in the last three years. Our department must grow or it
will atrophy like some of the more established departments.
I am looking forward to a lively exchange between our offices in
the next several months. We have much at stake for the future of this
department.
GENE
-------
-------
∂09-Nov-82 0727 pratt at Navajo statistics (cc)
Mail-from: SU-NET host Navajo rcvd at 9-Nov-82 0725-PST
Date: 9 November 1982 07:28:18-PST (Tuesday)
From: pratt at Navajo
Subject: statistics (cc)
To: faculty at score
----Forwarded mail
From pratt Tue Nov 9 07:19:21 1982
Date: 9 November 1982 07:19:21-PST (Tuesday)
From: pratt
Subject: statistics
To: csd.golub at score
The bit about going from 13.25 to 15.05 (such fine grain?) slots between
1974 and now must count as one of our most powerful weapons in going after
more slots. What other statistics are there that would have comparable
impact? I think if all CS faculty, not just the administrative one(s),
have those statistics to hand it will do a lot towards increasing the
pressure on H&S.
-v
∂09-Nov-82 0729 pratt at Navajo statistics
Mail-from: SU-NET host Navajo rcvd at 9-Nov-82 0726-PST
Date: 9 November 1982 07:28:53-PST (Tuesday)
From: pratt at Navajo
Subject: statistics
To: csd.golub at score
Cc: faculty at score
We really need to do our homework here. I suggest we (?) not merely
stockpile statistics but also analyse them. For example we could collect
data on how the "age bulge" is moving through various leading computer science
departments. I have the feeling we are behind many other universities in
replenishing our staff at the low end, but it would be very good to have
data, charts, even 3-D plots, to back this up and give our arguments some
real substance!
-v
∂09-Nov-82 1003 Nancy Dorio <CSD.DORIO at SU-SCORE> pmessage
Date: 9 Nov 1982 1001-PST
From: Nancy Dorio <CSD.DORIO at SU-SCORE>
Subject: pmessage
To: jmc at SU-AI
Stanford-Phone: (415) 497-2273
John,
Toni McConell called from the museum of Science and Industry
in Chicago. She needs biographical information about you as well as a
photo. She claims she sent you a letter in regards to this and has
received no response. Please call her at 312 684-1414.
Nan
-------
∂09-Nov-82 1135 Nancy Dorio <CSD.DORIO at SU-SCORE> pmessage
Date: 9 Nov 1982 1130-PST
From: Nancy Dorio <CSD.DORIO at SU-SCORE>
Subject: pmessage
To: jmc at SU-AI
Stanford-Phone: (415) 497-2273
Scott Palmer called from Data Processing Mngmt, Magazine. he says that Doug
Hoffstadter recommended that he call you. Please return the call.
800 428-6179.
Nan
-------
∂09-Nov-82 1518 Bolles at SRI-AI CPR Class
Date: 9 Nov 1982 1518-PST
From: Bolles at SRI-AI
Subject: CPR Class
To: AIC-Associates:
An 8-hour Red Cross Cardio-Pulmonary Resuscitation (CPR) class will be held
at SRI on Monday, Dec 6 and Wednesday, Dec 8 in Trailer 203T from 5:05PM to
9:05PM. Contact Health and Safety, x2212, if interested.
-------
∂09-Nov-82 1617 Andrei Broder <CSD.Broder at SU-SCORE> Next AFLB talks
Date: 9 Nov 1982 1540-PST
From: Andrei Broder <CSD.Broder at SU-SCORE>
Subject: Next AFLB talks
To: aflb.all at SU-SCORE
cc: csd.dorio at SU-SCORE
Stanford-Office: MJH 325, Tel. (415) 497-1787
T H E N E X T A F L B - T A L Ks
11/11/82 Prof. Stephen Smale (Berkeley):
"Average case analysis of the simplex algorithm"
The simplex method of George Dantzig is extensively used to solve
linear programming problems and is extremely efficient. The goal of
this paper is to give some theoretical explanation for this efficiency
in terms of average data.
The problem is well-known. For example, recently Philip Wolfe wrote:
"Dantzig's 'simplex method' has been shown not to run in polynomial
time, but in exponential time, in the worst case. 'Worst case'
behavior is always the easiest to study; a theory of 'average'
behavior, which would explain the fact that in practice, the simplex
method acts like a highly efficient polynomial time algorithm, does
not exists."
Here we focus on a version of the above problem stated in Dantzig's
book, 1963, p. 160: "Some believe that for a randomly chosen problem
with fixed m [the number of constraints] the number of iterations
grows in proportion to n [the number of variables]." We prove it,
using a standard variant of the simplex method.
******** Time and place: Nov. 11, 12:30pm in MJ352 (Bldg. 460) ********
11/18/82 Harry Mairson (Stanford):
"The program complexity of searching a table"
Given a fixed set S of n keys, we would like to store them so that
queries of the form ``Is x in S?'' can be answered quickly. A
commonly employed scheme to solve this problem uses a table to store
the keys, and a special purpose program depending on S which probes
the table. We analyze the tradeoff between the maximum number of
probes allowable to answer a query, and the length of the program to
do so. Perfect Hashing (where the query must be answered in one
probe) has a program complexity of (n lg e)(1+o(1)) bits, and this
lower bound can be achieved. Under a somewhat restricted model it is
shown that for t probes to the table, (nt)/(2↑(t+1))(1+o(1)) bits are
necessary and sufficient to describe a table searching algorithm.
Some models where pointers are allowed in the table are also analyzed.
In addition, we prove some lower bounds on the worst-case behavior of
universal classes of hash functions.
******** Time and place: Nov. 18, 12:30pm in MJ352 (Bldg. 460) ********
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Regular AFLB meetings are on Thursdays, at 12:30pm, in MJ352 (Bldg.
460).
If you have a topic you would like to talk about in the AFLB seminar
please tell me. (csd.broder@score, MJH325, 497-1787) Contributions
are wanted and welcome. Not all time slots for this year have been
filled so far.
For more information about future AFLB meetings and topics you might
want to look at the file [SCORE]<csd.broder>aflb.bbboard.
-------
∂09-Nov-82 1724 Nancy Dorio <CSD.DORIO at SU-SCORE> COLLOQUIUM NOTICE WEEK OF NOVEMBER 15 - 19, 1982
Date: 9 Nov 1982 1548-PST
From: Nancy Dorio <CSD.DORIO at SU-SCORE>
Subject: COLLOQUIUM NOTICE WEEK OF NOVEMBER 15 - 19, 1982
To: colloq: ;
Stanford-Phone: (415) 497-2273
Date Place Person
Day Event From
Time Title
-------------------------------------------------------------------------------
11/15/82 Math 380C Beresford Parlett
Monday Numerical Analysis U.C. Berkeley
4:15 p.m. Seminar ``Tracking a Few Exterior Eigenvalues of a
Growing Tridiagonal Matrix''
11/16/82 MJ352 Mr. Curt Langlotz
Tuesday Medical Computing Stanford University
1:30 p.m. Journal Club ``Recent Articles of Interest''
11/16/82 MJ352 Dr. Bill Brody
Tuesday Medical Technology Stanford Medical Center
2:30 p.m. Research Seminar ``Digital Angiography''
11/16/82 ERL401 Richard N. Taylor
Tuesday Program Analysis University of California, Irvine
2:30 p.m. Seminar ``Analysis of Concurrent Ada Programs''
11/16/82 Jordan 040 A. Shoshani
Tuesday Computer Science Lawrence Berkeley Laboratory
4:15 p.m. Colloquium ``SUBJECT: A system for Supporting Statistical
Databases''
11/17/82 MJ252 Kamran Parsaye
Wednesday MTC & FORMAL Hewlett-Packard
12 p.m. SYSTEMS Seminar ``Higher Order Abstract Data Types''
11/17/82 Terman Auditorium Skip Stritter
Wednesday Computer Systems Nestar Inc., Palo Alto
4:15 p.m. Laboratory Seminar ``Network Architecture for Personal Computers''
11/18/82 MJ352 Mr. Harry Mairson
Thursday AFLB Stanford University
12:30 p.m ``The Program Complexity of Searching a Table''
11/19/82 MJ352 Professor Will Gillett
Friday Database Research Washington University, St Louis
3:15 p.m. Seminar ``Abstract Database System (ADS): A Data Model
Based on Abstraction of Symbols''
-------
∂10-Nov-82 0900 JMC*
pjh
∂10-Nov-82 1046 ARG my dissertation
John - I want to let you know that I'll have a draft of my dissertation for
you to read very shortly, hopefully next week. I gave Tom Binford
a draft last month which he should be finished with in the next few
days. As soon as I incorporate his suggested changes you'll get a
copy of the new draft. I'm planning on making the December deadline
which hopefully will not be a problem.
Ron
∂10-Nov-82 1542 Paul Armer <CSD.ARMER at SU-SCORE> Comprehensive Committee
Date: 10 Nov 1982 1542-PST
From: Paul Armer <CSD.ARMER at SU-SCORE>
Subject: Comprehensive Committee
To: ketonen at SU-AI
cc: csd.golub at SU-SCORE, csd.pratt at SU-SCORE,
: ;
Stanford-Phone: (415) 497-2906
Gene Golub would like for you to serve on the Comprehensive Committee
for the MTC area effective immediately. Members serve for two exams.
Vaughan Pratt is the commmittee chairman and he will be in touch with you
concerning meetings.Paul
-------
∂10-Nov-82 1622 Gene Golub <CSD.GOLUB at SU-SCORE> [John McCarthy <JMC at SU-AI>:]
Date: 10 Nov 1982 1501-PST
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: [John McCarthy <JMC at SU-AI>:]
To: jmc at SU-AI
Ah, a new word.
John! This is errific. Can you have it set up as a letter?
---------------
Mail-from: ARPANET site SU-AI rcvd at 4-Nov-82 1623-PST
Date: 04 Nov 1982 1622-PST
From: John McCarthy <JMC at SU-AI>
To: csd.golub at SU-SCORE
Dear Gene:
This is to add my recommendation to those for Mike Genesereth.
I would have written earlier if asked, but frankly I didn't think that
there could be any question of his appointment at the assistant
professor level, since I think he is the most promising AI
appointment we have made in a long time.
My reason for saying this is that I believe he is working
on precisely the problem in AI that I think has the greatest
potential for a major breakthrough. This is the representation
of information about situations and goals in predicate logic
coupled with the use of predicate logic to express the statements
that control the search for a solution to the problem.
This is a tough problem, and he may not succeed. However,
it is the fundamental problem that almost all other researchers
are evading. Stanford is in the fortunate position of getting
an almost free ride. If he succeeds we win big. If he doesn't
succeed we may have a hard time making up our minds when a tenure
decision has to be made if the byproducts are at all interesting.
To make explicit comparisons, I rate Genesereth's chance
of making a major breakthrough as better than that of Jerry Feldman,
Cordell Green or Raj Reddy - compared as of similar stages in their
careers. Our other candidate for a major breakthrough in AI is
Lenat, but my estimates of what is likely to succeed would put
Genesereth ahead of him.
I also consider Genesereth to have the personal qualities
of responsibility, intelligence and co-operativeness required for
success in an academic environment, and I see no important
weaknesses.
I have not had much interaction with Mike except for some
discussions about non-monotonic reasoning. When I get circumscription
into good intellectual shape, then I may be pressing him to put
some of the formalism into his system MRS.
.reg
-------
∂10-Nov-82 1620 Andrei Broder <CSD.Broder at SU-SCORE> O.R. Colloquium
Date: 10 Nov 1982 1450-PST
From: Andrei Broder <CSD.Broder at SU-SCORE>
Subject: O.R. Colloquium
To: aflb.all at SU-SCORE
Stanford-Office: MJH 325, Tel. (415) 497-1787
You might want to attend the following colloquium held by the Stanford
O.R. Dept.
Prof. George Dantzig: "Reminiscences about the origins of linear
programming"
Wed., Nov. 17, 1982, 4:30 p.m.; Bldg. 320 (geology corner), room 334.
(Refreshments: Terman 453, 4:15 p.m.)
-------
∂10-Nov-82 1624 Betty Scott <CSD.BSCOTT at SU-SCORE> Maribel Calderon
Date: 10 Nov 1982 1550-PST
From: Betty Scott <CSD.BSCOTT at SU-SCORE>
Subject: Maribel Calderon
To: JMC at SU-AI, ZM at SU-AI
cc: CSD.Yearwood at SU-SCORE, CSD.BScott at SU-SCORE
Marlie talked with Maribel today; she has accepted the position of
your secretary, and will begin work on Monday, November 29. Maribel
had planned a vacation for the week before and the week after Christmas,
and after checking with John, we have told her that this is o.k.
Maribel's salary will be approximately $90/month more than Fran's because
she has worked longer at the University. I think that you both will like
Maribel and that she will be a good secretary.
Thanks to Marlie for the time and effort she devoted to finding and inter-
viewing applicants.
Betty
-------
∂10-Nov-82 1712 Betty Scott <CSD.BSCOTT at SU-SCORE> Applicants
Date: 10 Nov 1982 1712-PST
From: Betty Scott <CSD.BSCOTT at SU-SCORE>
Subject: Applicants
To: JMC at SU-AI
cc: CSD.Yearwood at SU-SCORE, CSD.BScott at SU-SCORE
John,
Marlie can't get on the system, so I'm sending this message in her behalf.
We have identified six more applicants for you to interview. Marlie
has set up interviews for you for tomorrow, 11/12, beginning at 2:00, half-hour intervals, with the last one at 4:30.
Marlie will give you a schedule and copies of the applications tomorrow.
Betty
-------
∂10-Nov-82 2028 Feigenbaum at SUMEX-AIM question re S1 project
Date: 10 Nov 1982 2028-PST
From: Feigenbaum at SUMEX-AIM
Subject: question re S1 project
To: jmc at SU-AI
John,
What was the name of the Stanford student whose machine architecture thesis
was instrumental in launching the S1 project? Where is he working now?
Ed
-------
There were two Stanford studends, Tom McWilliams and L. Curt Widdoes,
but the S-1 project was launched, on the basis of their ideas,
several years before they completed their theses. Also Mike Farmwald
did a thesis based on his work in designing the arithmetic unit of the
S-1. Widdoes runs a small company, and McWilliams and Farmwald are
still with the S-1 project. I believe that all of them had Baskett
as thesis adviser.
∂10-Nov-82 2117 Gene Golub <CSD.GOLUB at SU-SCORE> New word
Date: 10 Nov 1982 2115-PST
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: New word
To: JMC at SU-AI
In-Reply-To: Your message of 10-Nov-82 1719-PST
My typing leaves much to be desired!
-------
∂10-Nov-82 2118 Feigenbaum at SUMEX-AIM (Response to message)
Date: 10 Nov 1982 2115-PST
From: Feigenbaum at SUMEX-AIM
Subject: (Response to message)
To: JMC at SU-AI
In response to your message sent 10 Nov 1982 2112-PST
John thanks for the swift answer!....Ed
-------
∂10-Nov-82 2133 Gene Golub <CSD.GOLUB at SU-SCORE> message from Hastorf
Date: 10 Nov 1982 2125-PST
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: message from Hastorf
To: faculty at SU-SCORE
I saw Hastorf briefly today and he said "Jerry gave you good advice".
I assume he means Lieberman's suggestion on getting new slots is a valid
one. Let's get going on this! GENE
-------
∂10-Nov-82 2240 David R. Cheriton <CSL.DRC at SU-SCORE> Modern Tuition Credit technology
Date: 10 Nov 1982 2236-PST
From: David R. Cheriton <CSL.DRC at SU-SCORE>
Subject: Modern Tuition Credit technology
To: csd.faculty at SU-SCORE
By accident, Tues after talking with G. Liebermann about the amount of
tuition creidts generated by the Humanities side of H and S, I found
myslef talking to a Stanford graduate, degree in history, who educated
me about the modern technology used by humanities for teaching and
tuition credits. Clearly CSD is totally antiquated in this area.
According to my informant, she found herslef in several courses
(history, classics, etc.) in which several hundred people registered
for the course and showed for the first lecture but essentially
didnt attend after that. Credit for the course was based on two papers
which she claimed the prof. and TA's told her could be and should be
copied out of a book or ordered from a professional writing service
so that there was no reall need to mark them. People smart enough
to figure out this received an A. Apparently this type of course
is known as a "Mic". This has got to be the ultimate in Low Overhead
Teaching Systems. Presumably we could solve some of our problems
in not contributing enough to Stanford as a department by adopting
these efficient techniques developed by the Humanities, and the Dean
and others would be much happier with us.
Of course, Tom Binford's remark that teaching/tuition is a money-loser
still bothers me. Perhaps if everyone adopted these more efficient
teaching methods, we could wing a profit?
-------
∂10-Nov-82 2306 Vaughan Pratt <pratt at Navajo> Tom's argument
Mail-from: SU-NET host Navajo rcvd at 10-Nov-82 2305-PST
Date: Wednesday, 10 Nov 1982 23:05-PST
To: David R. Cheriton <CSL.DRC at SU-SCORE>
Cc: csd.faculty at SU-SCORE
Subject: Tom's argument
In-reply-to: Your message of 10 Nov 1982 2236-PST.
From: Vaughan Pratt <pratt at Navajo>
If mic's exist on the scale your informant suggested then Stanford has a very
serious problem that is no joking matter. I'm skeptical that the abuse is
quite at the scale described, but I'm ready to be rudely awoken.
Tom's argument: tuition doesn't pay its way, therefore increased enrollment is
a money-losing proposition. Logical conclusion: decrease enrollment to zero.
Fiscal consequence: easily deduced. Did I just smell a fried transistor?
-v
∂11-Nov-82 0123 David R. Cheriton <CSL.DRC at SU-SCORE> Clarification on Tuition Credit Technology
Date: 11 Nov 1982 0123-PST
From: David R. Cheriton <CSL.DRC at SU-SCORE>
Subject: Clarification on Tuition Credit Technology
To: csd.faculty at SU-SCORE
My previous (frivolous) message was not intended to suggest that
this was a widespread practice (I dont know) or that we should use
this in discussions with the Dean, etc. Perhaps the intelligent comment
is:
Our objective is a first-rate department. False measures like tuition
credits or (in fact) research dollars only lead to the type of game I
described. I fully support following Gene's suggestion to get more positions
and supporting the case by arguing that they are necessary for us to maintain
our current position as a top-rated department. I suggest we only bring up
research dollars in claiming that new positions would not cost the university
money and therefore cannot be denied for budgetary reasons.
I certainly hope and expect that Stanford will make that extra effort that
is required to allow a department in an explosive field like Computer Science
maintain its top rating.
-------
∂11-Nov-82 0748 Edward J. McCluskey <CSL.CRC.EJM at SU-SCORE> Re: Modern Tuition Credit technology
Date: 11 Nov 1982 0747-PST
From: Edward J. McCluskey <CSL.CRC.EJM at SU-SCORE>
Subject: Re: Modern Tuition Credit technology
To: CSL.DRC at SU-SCORE
cc: csd.faculty at SU-SCORE
In-Reply-To: Your message of 10-Nov-82 2236-PST
urgent - can you find out the numbers of this course???
I've got two sons at Stanford who are working their little .. s off
they could really use the unit credits of A generated by such a
course..
-------
∂11-Nov-82 1008 Nancy Dorio <CSD.DORIO at SU-SCORE> pmessage
Date: 11 Nov 1982 0958-PST
From: Nancy Dorio <CSD.DORIO at SU-SCORE>
Subject: pmessage
To: jmc at SU-AI
Stanford-Phone: (415) 497-2273
Jerry Conover called form Princeton University. He wants a picture of you
for the Alumni office at the University. Please return the call at 609
452-3564. (this message was received by Mandy Walker during my absence
from the switchboard).
Nan
-------
∂11-Nov-82 1057 TOB AFOSR internal advisory board meeting
To: JMC, MAS
John
The meeting will begin at 2:15 Monday, instead of
2:00.
Tom
∂11-Nov-82 1112 SHOSTAK at SRI-CSL graph colorings and such
Date: 11 Nov 1982 1111-PST
From: SHOSTAK at SRI-CSL
Subject: graph colorings and such
To: jmc at SU-AI
John-
The linear programming problem I mentioned yesterday is
as follows: determine the feasibility of a set of integer linear inequalities
each of which mentions no more than two variables, and such that the
value of each variable must be chosen from a set of exactly two possibilities.
For example, { x < 2y, y < z + 3, y > 0} where, say, x is either 2 or 3,
y is either 3 or 4, and z is either 4 or 5.
Charles Kelemen (LeMoyne College) observed that you could solve this
problem fast (polynomial time) using the following algorithm based
on a scheduling technique of Even, Itai, and Shamir:
(Terminology: At a given stage, when some of the variables have been
assigned, say that a variable is IMPOSSIBLE if it cannot be assigned
a value consistent with the constraints (checked individually) and the
previous assignments. Say it is IMPLIED if there is only one possible
value to assign it.)
(1) Set PHASE = 2
(2) If all variables have been assigned, halt with a feasible solution.
(3) If some unassigned var is impossible, go to (5)
(4) If some var is implied, temporarily assign it its forced value
and go back to 2. Otherwise, make all temporary assignments
permanent, choose some unassigned variable (call it the RECORDED
variable), temporarily assign to it one of its two possible
values, set PHASE = 1, and go back to 2.
(5) If PHASE=2, halt with infeasibility. Otherwise, change the value
of the recorded var to its other possiblity, undo all temporary
assignments, set PHASE = 2, and go back to (3).
The subtlety here is that at step (4), if there is no implied var,
it is safe to make all the assignments up to this point permanent;
if some previous assignment could (eventually) lead to a contradiction,
some var would have to be either implied or impossible at this point.
This suggests a kind of dual to your Lemma of Deferral idea; the dual lemma
(call it a Lemma of Acceptance) would say not that you can afford to defer
the instantiation of certain variables, but that you can afford to make
permanent some choices you have already made, because they are (provably) as
good as any other choices that could have been made. You thus need not
backtrack above the point of application of the Lemma of Acceptance.
-Rob
-------
∂11-Nov-82 1117 ZM schedule
I usually prefer afternoons for such exams.
What about Tuesday 1:30, 3:00, and 4:30
∂11-Nov-82 1209 Nancy Dorio <CSD.DORIO at SU-SCORE> it will not go
Date: 11 Nov 1982 1137-PST
From: Nancy Dorio <CSD.DORIO at SU-SCORE>
Subject: it will not go
To: jmc at SU-AI
Stanford-Phone: (415) 497-2273
The system keeps on saying ?no such local user as jmcjnk.
Back to the drawing board.
Nan
-------
∂11-Nov-82 1324 Paul Armer <CSD.ARMER at SU-SCORE> Committee Assignments
Date: 11 Nov 1982 1314-PST
From: Paul Armer <CSD.ARMER at SU-SCORE>
Subject: Committee Assignments
To: CSD-Faculty: ;
Stanford-Phone: (415) 497-2906
The following memo is available on line as <csd.files>comm.assign.
We will also be sending you a hard copy version of this.
To: CSD Faculty, Students and Staff
From: Gene Golub/Paul Armer
Subject: Preliminary Committee Assignments for 1982-83
This memo presents a first pass at committee assignments for 1982-83.
Committees come in two flavors: 1.) Normal faculty/staff/student committees,
2.) staff committees. The latter implement policies and procedures
originally instituted by the faculty. There are also student committees but
they are not the subject of this memo. We encourage faculty members to
contribute ideas, suggestions and assistance to the staff committees.
Anyone who wishes to serve on a committee but has not been appointed should
talk to the committee chairperson. Volunteers are almost always welcome.
Our two heaviest commitpα0¬es are Admisssions and Comprehensive. Comprehensive
Committee assignments are made on a rotating basis, usually independent
of other committee assignments. One serves for two consecutive exams.
We usually have enough volunteers for the Admissions Committee.
We will be making assignments to have individuals look at
Courses and Degrees by subject area for suggested changes therein. You will
note that we have combined Computer Facilities and Computer Facilities
Planning.
If we've missed any existing commmittee please speak up.
Suggested committee rosters are given below. The chair is listed first.
FACULTY COMMITTEES
Academic Advisor of Manna
New Ph.D. Students
Admissions Reid, Grosz , Herriot, Lantz, McCarthy, Pratt
Armer, Clarkson, Finlayson
Apointments and All tenured faculty plus Shore
Promotions
Colloquium (Autumn) Mayr
(Winter) Lantz
(Spring) Oliger
(Autumn '83) Lenat
Comprehensive
1/82 to 1/83 Pratt, Feigenbaum, Mayr, Ullman
Stolfi, Worley
10/82 to 5/83 Cheriton (Chair 1/83 to 5/83), Floyd, Gorin, Ketonen,
Mayo, Schreiber (Autumn only), Wilkinson (Winter only)
Asente, Siegel
1/83 to 1/84 McCluskey (Chair 5/83 to 1/84), Genesereth,
CSL-Software
10/83 to 5/84 Yao (Chair 1/84 to 5/84) Oliger, McCarthy,
CSL-Hardware
Computer Facilities Ullman, Feigenbaum, Mayr, McCarthy, Novak, Oliger,
Reid, Gorin, Keller, Mogul
Computer Forum Miller, Lenat, Reid
Armer, Jouppi, Kornfield, Lieberman, Tajnai, Trietel
CSAI Feigenbaum, Lenat, Binford, Novack plus one student
CSCE and Masters Ullman, Cheriton, Floyd, Genesereth, Oliger, plus
Overview one student
(Oliger will chair beginning Spring 1983)
Curriculum Binford, Schreiber
Graduate Studies Floyd, Binford, Buchanan, Armer, plus one student
Industrial Lectureship Golub, McCarthy, Lantz, plus one student
Mathematical Studies McCarthy, Mayr
Representatives
Medical Information Shortliffe, Buchanan
Science
Provost's Advisory Knuth
Board
Space Golub, Feigenbaum, Binford, Pratt, Ullman,
Armer, Gorin, Scott, Dietterich
STAFF COMMITTEES
Comuter Science Golub, Armer, Schack
Advisory Committee
Fellowships and Awards Armer, Scott, plus two students
Fund Raising Golub, Armer, Schack
Library and Armer, Herriot, Berg, Gotelli, Yearwood,
Publications Mackinlay, Davidson
TA/RA Reges, Armer, Scott, Walker
Space Allocation Golub, Armer, Gorin, Scott
Visitors Golub, Armer, Schack
-------
∂11-Nov-82 1356 Rita Leibovitz <CSD.rita at SU-SCORE> FOO
Date: 11 Nov 1982 1232-PST
From: Rita Leibovitz <CSD.rita at SU-SCORE>
Subject: FOO
To: JMC at SU-AI
Stanford-Phone: (415) 497-4365
John:
Did you get the FOO msg. at "#JMCJNK[1,jmc]"@sail?
Rita
<Don't forget, it will cost you for my time...a smile!>
-------
∂12-Nov-82 0838 Nancy Dorio <CSD.DORIO at SU-SCORE> pmessage
Date: 12 Nov 1982 0828-PST
From: Nancy Dorio <CSD.DORIO at SU-SCORE>
Subject: pmessage
To: jmc at SU-AI
Stanford-Phone: (415) 497-2273
Rose Taylor called from News Scientist Magazine in London to say that she
needs a photo of you for a feature article they are doing on you. Please
send it to:
Commonwealth house
1-19 new Oxford Street
London WC1
She will send you the magazine with the feature article when it comes out.
Nan
-------
∂12-Nov-82 0908 JJW EKL at LOTS
To: JK, JMC
EKL is now up and running at LOTSB. The easiest way to run it is
to set up in your LOGIN.CMD file the line
define dsk: dsk:,bx:<ekl>
and then you can just say EKL to the @ prompt.
So far, the only problem I have encountered is that the right-brace
character is thought to be octal 176, because the files were compiled
here at SAIL, while the ASCII right-brace is 175. Thus, to use the
brace constructions you currently have to say things like
{x,y,z~
since ~ is character 176 in ASCII. (This is rarely used anyway.)
∂12-Nov-82 1337 Marlene Yearwood <CSD.YEARWOOD at SU-SCORE> Interviews, etc
Date: 12 Nov 1982 1329-PST
From: Marlene Yearwood <CSD.YEARWOOD at SU-SCORE>
Subject: Interviews, etc
To: jmc at SU-AI
cc: : ;
Stanford-Phone: (415) 497-6622
I have checked the references on the three applicants from
yesterday, and I think it would be appropriate to meet and
discuss the results. This p.m. or Monday p.m. would be fine
with Betty and me. Let me know when. Thanks. marlie
-------
∂12-Nov-82 2035 LGC
∂12-Nov-82 2009 JMC
To: ZM, RPG, LGC, CG, CLT, LGC, JJW, YOM
CC: ARK
Diana Hall, our new secretary, will start in about a week.
LGC - Thought you might want to know that the above To:-list contains two
occurrences of my pn, but none of JK's. And, of course, MAIL dutifully sent
me two identical messages.
∂13-Nov-82 0946 pratt@Navajo (SuNet) Re: distribution list for Admissions committee
Date: Saturday, 13 Nov 1982 09:46-PST
To: Brian Reid <reid at Shasta>
Cc: Comp-committee at Score, ARK at Sail, JGH at Sail, Lantz at Diablo,
JMC at Sail, KLC at Sail, RSF at Sail
Subject: Re: distribution list for Admissions committee
In-reply-to: Your message of Friday, 12 Nov 1982 20:03-PST.
From: Vaughan Pratt <pratt at Navajo>
The Comp committee just went through something similar with their distribution
list. The list comp@navajo was already in use by the committee,
and was working just fine, but some of the members of the committee felt that
it should be on Score. Arthur Keller obligingly set up a corresponding list
on Score, permitting replacing the list of people filed under comp@navajo
with "comp-committee@score". The only inconvenience was having to
move the messages archived thus far on Navajo to the archive on Score that
Arthur had set up, a process complicated by the aphasic nature of
the Score mailer, which won't allow outsiders to mail either to Score files
or to people on lists at Score without assistance from Mark Crispin.
There is an interesting question here as to what the correct procedure in
these things should be. CSD administration seems to have Score as its home.
On the other hand few if any committee chairpeople have Score as their home
machine (besides those in CSD administration). Computer usage is widely
distributed at Stanford, fitting Jerry Saltzer's "bureaucracy avoidance" model
accurately. The question seems then to turn on who is responsible for
setting up and maintaining the list and associated archive(s) - the
chairperson or CSD administration.
It is unreasonable to ask the chairperson to have to struggle with the
limitations of Score, both in its mailer limitations and its utter
unusability at peak periods, when list maintenance and archiving works
smoothly on the chairperson's home machine. On the other hand, many
chairpeople may prefer to have list maintenance and archiving performed as a
service on their behalf. Such a service would be worthwhile provided it met
the following criteria.
1. Regular. It should be performed automatically for every committee.
Both the distribution list and archiving file should be set up by the CSD
administration at the time the committee chairperson is named, so that the
chairperson can use both services immediately.
2. Standard. It should meet a set of standards applied uniformly over all
committees.
3. Reliable. The service should operate smoothly for all its users.
4. Open. Both the distribution list and archiving file should be readable
by the committee, at least. The archives <csd.admin.csd>comp.messages and
<csd.admin.csd>admissions.messages exist but are presently read-protected
against the nonvandal members of their respective committees, which defeats a
major purpose of having them (being able to look over old messages).
Besides, the low security of all computers at Stanford, Score being no
exception, makes such protection something of a joke, as any competent vandal
will tell you.
5. Flexible. Recognizing the limitations of electronic mail, alternative
contact routes should be maintained as part of the service. A list of
addresses and phone numbers, both home and work, for all committee members
should be circulated to the committee, maintained either as part of the
distribution list or as a separate list. (I did this myself for my committee
as the first time I needed it I needed it in a hurry (as usual), but it was
tedious enough work that I'd be happy to have it done by CSD administration.)
-v
∂13-Nov-82 1252 JJW 206 Midterms
I finished the grading, and put the exam books in the left-hand drawer of
my desk. The distribution of scores is as follows:
X
X
X X
X X X X X
X XXX X X X X X X
X X XX XXX X XX X X X X X X XX XX
+---------+---------+---------+---------+---------+---------+-
20 30 40 50 60 70 80
∂13-Nov-82 2027 KMP at MIT-OZ at MIT-MC headerless mail
Date: 13 Nov 1982 2146-EST
From: KMP at MIT-OZ at MIT-MC
Subject: headerless mail
To: jmc at SU-AI
i sent the empty message by accident and later decided not to send the message
until i have time to compose my thoughts on the issue better. i have some
rather strong objection to the semantics of "#," in lisp, but i do not know
exactly how to resolve the objections productively in a lisp that does not
have an "enclose" time a la Scheme. more on this will show up later as a
non-empty message to common-lisp. thanks for noting it though,... --kmp
-------
∂14-Nov-82 1525 RPG Scheme
I have the files here, but will need to be at stanford to figure
out what to do with them - the bandwidth is too low at home.
-rpg-
∂14-Nov-82 1934 JJW
∂14-Nov-82 1624 JMC
Are the LIsp axioms at LOTS?
JJW - Yes, in BX:<EKL>LISPAX.CMD at LOTSB.
∂14-Nov-82 2013 RPG Bad, Bad!
I've been hacking off and on with Scheme since about 4pm. It seems that
there are so many places where the Scheme files know about MIT things and
a different character-set, that I think it might take me about another
3 days of solid hacking to figure it all out. First I'll have to build
up a global data base to know where functions are because they don't seem
to be partitioned well into files.
-rpg-
∂15-Nov-82 0000 ZM Qual
I must take my daughter to the doctor tomorrow morning.
Pratt agreed to replace me in the Qual. He will come at 9am. Zohar
OK, though the students were expecting you.
∂15-Nov-82 0925 JK
∂15-Nov-82 0050 JMC bug
The permut.prf attempts a rewrite as its last step. I don't understand
why nothing happens.
------
There was no info on how to conclude that x.nil is of list sort -
you have to include a reference to sort info in your rewriter.
∂15-Nov-82 0946 MAS AFOSR/CAMS Meeting
This meeting will not be in 252 MJH, but in 026 Durand (at 2:15 today).
∂15-Nov-82 1201 TOB aaup
Jeff
What is your opinion about the value of membership
in AAUP?
Tom
∂16-Nov-82 0856 Nancy Dorio <CSD.DORIO at SU-SCORE> pmessage
Date: 15 Nov 1982 1156-PST
From: Nancy Dorio <CSD.DORIO at SU-SCORE>
Subject: pmessage
To: jmc at SU-AI
Stanford-Phone: (415) 497-2273
Sarah Boxer called from Sciences Magazine, N.Y. Academy of Sciences. She
requests that you return the call collect at 212 838-0230
-------
∂16-Nov-82 1053 Kent M. Pitman <KMP at MIT-MC> followup
Date: 16 November 1982 13:53-EST
From: Kent M. Pitman <KMP at MIT-MC>
Subject: followup
To: jmc at SU-AI
did you ever receive copies of the Sussman/Abelson notes on Scheme? if they
haven't reached you by now, i should go prod Sussman's secretary to make
sure the request hasn't been lost... --kmp
Yes, I received them, and thanks. I haven't received any T material though.
∂16-Nov-82 1800 Paul Armer <CSD.ARMER at SU-SCORE> Meeting.
Date: 16 Nov 1982 1754-PST
From: Paul Armer <CSD.ARMER at SU-SCORE>
Subject: Meeting.
To: JMC at SU-AI, csd.feigenbaum at SU-SCORE, dek at SU-AI,
Csd.golub at SU-SCORE, csd.ullman at SU-SCORE
cc: admin.gorin at SU-SCORE
Stanford-Phone: (415) 497-2906
We have setup a meeting with Hastorf, Wessells and Lieberman on Wednesday
December 8 at 3p.m. in Hastorf's office (conference room). You are all
invited. The idea is to say that we want to stay number one and we need
their help to do so. The problem can be characterized by one phrase--
the need to grow. WE need additional faculty billets to keep up with the
exponential intellectual growth of the field and we need space, not only
to house what we now are but the new faculty as well. Depending on how
an earlier meeting goes we may want to bring up the fact that enrollments
are growing and we are going broke paying the excess TA bill. Consequently{
we are considering cutting back on enrollment.
Paul
-------
∂17-Nov-82 0916 Chappell at SRI-AI Carl Hewitt's Visit
Date: 17 Nov 1982 0917-PST
From: Chappell at SRI-AI
Subject: Carl Hewitt's Visit
To: TINlunchers:
FROM: Jerry Hobbs
SUBJECT: TALK - TINLUNCH
DATE: November 19, 1982
PLACE: EK242
TIME: 10:30AM
Carl Hewitt will give a talk at 10:30 on Friday the 19th of November
in EK242. The title of the talk is "Open Systems." TINLUNCH
discussion to follow the talk.
The tinlunch reading is "Open Systems" by Carl Hewitt and Peter de
Jong. Copies of the reading are on the file cabinet in EJ251.
-------
∂17-Nov-82 0934 Aaai-Office at SUMEX-AIM Your Dues in AAAI
Date: 17 Nov 1982 0933-PST
From: Aaai-Office at SUMEX-AIM
Subject: Your Dues in AAAI
To: Bobrow at PARC-MAXC, JMC at SU-AI, Simon at CMU-10A, Minsky at MIT-AI,
DWaltz at BBNC, Walker at SRI-AI, Reddy at CMU-10A, Stan at SRI-AI,
CSD.Genesereth at SU-SCORE, Hart at SRI-KL, Buchanan at SUMEX-AIM,
Tenenbaum at SRI-KL, Scott.Fahlman at CMU-10A, LErman at SRI-KL
cc: aaai-office at SUMEX-AIM
Dear AAAI Executives
Don't want to get terribly pushy.
Just a Friendly Reminder. I'm sure this is but a temporary
oversite on your part:
Your 1982-83 AAAI dues are now due and payable.
Dues are $25.00. Checks should be made payable to: AAAI.
Our address is:
AAAI
445 Burgess Drive
Menlo Park, CA 94025
Lou Robinson
-------
∂17-Nov-82 1027 Don Walker <WALKER at SRI-AI> Re: Your Dues in AAAI
Date: 17 Nov 1982 1024-PST
From: Don Walker <WALKER at SRI-AI>
Subject: Re: Your Dues in AAAI
To: Aaai-Office at SUMEX-AIM
cc: Bobrow at PARC-MAXC, JMC at SU-AI, Simon at CMU-10A, Minsky at MIT-AI,
DWaltz at BBNC, Reddy at CMU-10A, Stan at SRI-AI,
CSD.Genesereth at SU-SCORE, Hart at SRI-KL, Buchanan at SUMEX-AIM,
Tenenbaum at SRI-KL, Scott.Fahlman at CMU-10A, LErman at SRI-KL
In-Reply-To: Your message of 17-Nov-82 0933-PST
No oversight, Lou; I have not previously been billed for it; tax records
require some form of record; I will be pleased to honor your message as
such and submit forthwith; sorry it can't be by netmail.
Don
-------
∂17-Nov-82 1111 Bobrow at PARC-MAXC Review of Dgano and Sirovich
Date: 17 Nov 1982 11:11 PST
From: Bobrow at PARC-MAXC
Subject: Review of Dgano and Sirovich
To: JMC@SU-AI
cc: JLAdams, Bobrow
John,
Some months ago I sent you a paper "An Evaluation Based Theorem Prover"
for you to review (actually I sent you a revision of the original which was
supposed to be readable). What is the status of the review? Can you still find
the paper? Will you give me a quick review? Thanks.
danny
I'll look for Dgano and Sirovich paper.
∂17-Nov-82 1626 Nancy Dorio <CSD.DORIO at SU-SCORE> pmessage
Date: 17 Nov 1982 1554-PST
From: Nancy Dorio <CSD.DORIO at SU-SCORE>
Subject: pmessage
To: jmc at SU-AI
Stanford-Phone: (415) 497-2273
Carl Akerloff called from slac in reference to your talk. Please return the
call at 7-3214.
-------
∂17-Nov-82 2256 JK
∂17-Nov-82 0120 JMC permut again
Would you take a look at the last bit of permut.lsp and tell me why
(trw |x.nil * reverse u| (use append_def (mode: t)) sortinfo simpinfo)
does nothing. I want, of course, x.reverse u. I'll be back from
L.A. tonight.
∂17-Nov-82 0126 JMC a bit more on permut
It looks like one needs the to use the definitions separately as well
as as part of definfo.
2. It may be grumbled at that you allow and use "-" in names like
get-proofs, but require the user to use "_" in labels.
-------
I looked at the proof and the reason append_def does not apply is that
the fool thing does not know that reverse u is a list.
So put that into sortinfo.
Looking at the proof I found two bugs in the control structure of the
rewriter which I fixed:
The command
19. (TRW |REVERSE SNOC(X,U)|
((USE SNOC_DEF (MODE: T)) (USE (REVERSE_APPEND SORTINFO) (MODE: T))
(USE 18)) SORTINFO)
now produces
REVERSE SNOC(X,U)=X.NIL*REVERSE U
∂18-Nov-82 1546 JK
(ue (phi |λu.u*nil=u|) listinduction nil sortinfo simpinfo)
∀U.U*NIL=U
∂18-Nov-82 1723 Feigenbaum at SUMEX-AIM Re: Meeting.
Date: 18 Nov 1982 1722-PST
From: Feigenbaum at SUMEX-AIM
Subject: Re: Meeting.
To: CSD.ARMER at SU-SCORE, JMC at SU-AI, csd.feigenbaum at SU-SCORE,
dek at SU-AI
In response to the message sent 16 Nov 1982 1754-PST from CSD.ARMER at SU-SCORE
I would very much like to be at the meeting with Hastorf et.al., but as I
explained to Gene, I have to give an invited speech at the Computers in
Science conference on the morning of the 8th in Chicago (plus other
commitments in the East on the 9th and 10th).
If it can be rescheduled, I would appreciate it.
Ed
-------
∂18-Nov-82 1934 YOM
arithx.lsp is now compatible with ekl. preliminary version. -yom.
∂18-Nov-82 2248 Gene Golub <CSD.GOLUB at SU-SCORE> Meeting on Space
Date: 18 Nov 1982 2235-PST
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: Meeting on Space
To: CSD-Tenured-Faculty: ;
Norm Wessels and Cal Quate want to meet with us before making their
"final" decision on space. There will be a special meeting of the tenured
faculty with Wessels and Quate on Tuesday, Nov 30 at 2PM in the Chairman's
Conference room. I hope you can make it.
GENE
-------
∂19-Nov-82 0900 JMC*
phone Elliott
∂19-Nov-82 0919 Chappell at SRI-AI TODAY's Talk (TINLUNCH to follow)
Date: 19 Nov 1982 0910-PST
From: Chappell at SRI-AI
Subject: TODAY's Talk (TINLUNCH to follow)
To: TINlunchers:
cc: chappell, navarro
FROM: Jerry Hobbs
SUBJECT: TALK - TINLUNCH
DATE: November 19, 1982
PLACE: EK242
TIME: 10:30AM
Carl Hewitt will give a talk at 10:30 on Friday the 19th of November
in EK242. The title of the talk is "Open Systems." TINLUNCH
discussion to follow the talk.
The TINLUNCH reading is "Open Systems" by Carl Hewitt and Peter de
Jong. Copies of the reading are on the file cabinet in EJ251.
On December 3, 1982, Barbara Grosz will be presenting COMPETITIVE
ARGUMENTATION IN COMPUTATIONAL THEORIES OF COGNITION by Kurt VanLehn,
John Seely Brown and James Greeno.
NOTE: NO TINLUNCH MEETING November 26, 1982
-------
∂19-Nov-82 0949 Nancy Dorio <CSD.DORIO at SU-SCORE> pmessage
Date: 19 Nov 1982 0949-PST
From: Nancy Dorio <CSD.DORIO at SU-SCORE>
Subject: pmessage
To: jmc at SU-AI
Stanford-Phone: (415) 497-2273
Eliott Bloom called and inquired as to weather or not you and he are having
lunch today at the faculty club. Please return the call at 494-8131.
-------
∂19-Nov-82 1058 JK
To: JMC, YOM, JJW
;facts on reverse: these do the facts mentioned in our meeting for reverse
;nuse is needed to prevent the use of the very facts you want to prove
;my version of lispax and permut are in lispax.cmd[ekl,jk]
(get-proofs permut)
(proof reverse)
(trw |reverse (x.nil)| (use reverse_def (mode: always)) sortinfo simpinfo)
;REVERSE (X.NIL)=X.NIL
(label simpinfo)
(trw |reverse (x.u)| (use reverse_def (mode: t)) sortinfo simpinfo)
(get-proofs permut)
;REVERSE (X.U)=REVERSE U*X.NIL
(label reverse_def1)
;proof of reverse_append
(ue (phi |λu.(reverse (u*v) = reverse(v) * reverse(u))|)
listinduction ((use reverse_def) (use reverse_def1 (mode: always))
(nuse reverse_reverse reverse_append)
(use simpinfo))
sortinfo)
;(∀X U.REVERSE (U*V)=REVERSE V*REVERSE U⊃
; REVERSE (U*V)*X.NIL=REVERSE V*REVERSE U*X.NIL)⊃
;(∀U.REVERSE (U*V)=REVERSE V*REVERSE U)
(assume |REVERSE (U*V)=REVERSE V*REVERSE U|)
(tci (*) |REVERSE (U*V)*X.NIL=REVERSE V*REVERSE U*X.NIL|
(use * (mode: always)) sortinfo simpinfo))
;REVERSE (U*V)=REVERSE V*REVERSE U⊃REVERSE (U*V)*X.NIL=REVERSE V*REVERSE U*X.NIL
(rw |-3| (use *))
;∀U.REVERSE (U*V)=REVERSE V*REVERSE U
;proof of reverse_reverse from reverse_append
(ue (phi |λu.reverse (reverse u) = u|)
listinduction ((use reverse_def) (use reverse_def1 (mode: always))
(use reverse_append (mode: always))
(nuse reverse_reverse) (use simpinfo))
sortinfo)
;∀U.REVERSE (REVERSE U)=U
;proof of reverse_rev
(trw |rev(nil,u)| (use rev_def (mode: always)) sortinfo simpinfo)
;REV(NIL,U)=U
(label simpinfo)
(trw |rev(x.u,v)| (use rev_def (mode: t)) sortinfo simpinfo)
;REV(X.U,V)=REV(U,X.V)
(label rev_def1)
(trw |(x.nil)*u| (use appendef (mode: t)) sortinfo simpinfo)
;X.NIL*U=X.U
(label simpinfo)
(trw |u*v*w=u*(v*w)| )
;U*V*W=U*(V*W)
(label appassoc)
(ue (phi |λu.∀v.(rev(u,v)=(reverse(u))*v)|)
listinduction
((use (reverse_def1 rev_def1) (mode: always))
(use appassoc (mode: always))
(nuse reverse_rev) (use reverse_def))
sortinfo simpinfo)
;∀U V.REV(U,V)=REVERSE U*V
(trw permut#reverse_rev ((use *) (nuse reverse_rev)) sortinfo simpinfo)
;∀U.REVERSE U=REV(U,NIL)
∂19-Nov-82 1045 DCL Lisp
To: JMC
CC: HST
John,
Do you still have the Lisp history manuscript Stoyan mentioned?
If so I would appreciate being able to take a look at it sometime.
- David
I put the Stoyan manuscript in interdepartmental mail yesterday.
Hopefully, you'll get it within a week.
∂19-Nov-82 1327 JK
To: JMC, YOM, JJW
(get-proofs permut)
(proof cprops)
(trw |∀x u.snoc(x,u)=reverse(x.reverse(u))|
(use (snoc_def reverse_def1) (mode: t))
sortinfo simpinfo)
∀X U.SNOC(X,U)=REVERSE (X.REVERSE U)
(ue (phi |λu.rac (u*(x.nil)) = x|) listinduction
(use rac_def1 (mode: always))
sortinfo simpinfo)
∀U.RAC (U*X.NIL)=X
(ue (phi |λu.rdc (u*(x.nil)) = u|) listinduction
(use rdc_def1 (mode: always))
sortinfo simpinfo)
∀U.RDC (U*X.NIL)=U
(ue (phi |λu.¬null u ⊃ snoc(rac u, rdc u)=u|) listinduction
(part 1 (use (snoc_def rac_def1 rdc_def1) (mode: always)))
sortinfo simpinfo)
∀U.¬NULL U⊃SNOC(RAC U,RDC U)=U
∂19-Nov-82 1328 RWW prolog
where is there a running version of prolog?
Thanks
Richard
Certainly at SRI-AI, but I had one put up on SCORE a year ago. Maybe
it's still available. It was on MRC's disk pack, and I forget how
to call it. If you have the time, you could put the SRI version
on SAIL.
∂19-Nov-82 1451 JK
To: JMC, JJW, YOM
;properties of rac,rdc,snoc,lcycle,rcycle
;the current set of axioms for permut and lispax can be found in lispax.cmd[ekl,jk]
(get-proofs permut)
(proof cprops)
(trw |∀x u.snoc(x,u)=reverse(x.reverse(u))|
(use (snoc_def reverse_def1) (mode: t))
sortinfo simpinfo)
;∀X U.SNOC(X,U)=REVERSE (X.REVERSE U)
(ue (phi |λu.rac (u*(x.nil)) = x|) listinduction
(use rac_def1 (mode: always))
sortinfo simpinfo)
;∀U.RAC (U*X.NIL)=X
(label rac_fact)
(ue (phi |λu.¬NULL U*X.NIL|) listinduction nil sortinfo simpinfo)
;∀U.¬NULL U*X.NIL
(label simpinfo)
(ue (phi |λu.rdc (u*(x.nil)) = u|) listinduction
(use rdc_def1 (mode: always))
sortinfo simpinfo)
;∀U.RDC (U*X.NIL)=U
(label rdc_fact)
(ue (phi |λu.¬null u ⊃ snoc(rac u, rdc u)=u|) listinduction
(part 1 (use (snoc_def rac_def1 rdc_def1) (mode: always)))
sortinfo simpinfo)
;∀U.¬NULL U⊃SNOC(RAC U,RDC U)=U
(label snoc_fact)
(trw |¬null snoc(x,u)| (open snoc) simpinfo sortinfo)
;¬NULL SNOC(X,U)
(label simpinfo)
(trw |(rcycle lcycle u)=u|
((open rcycle lcycle snoc) (use (rac_fact rdc_fact)))
sortinfo simpinfo)
RCYCLE (LCYCLE U)=U
(rw snoc_fact (open snoc) simpinfo sortinfo)
;∀U.¬NULL U⊃RDC U*RAC U.NIL=U
(trw |(lcycle rcycle u)=u|
(open rcycle lcycle snoc)
* sortinfo simpinfo)
LCYCLE (RCYCLE U)=U
∂19-Nov-82 1510 JK flat
Can be gotten out of the axiom sexpinductiondef in lispax
∂21-Nov-82 1006 JK lispax
To: JJW, YOM, JMC, JK
I have a cleaned up version of everything in lispax.lsp[ekl,jk].
In particular, I believe that the set of lisp axioms there is the one
that should be used: it works very well. The main changes involve
getting rid of sortinfo (merged with simpinfo). Also it turns out that
from the point of view of re-writing it is better to have recursive
definitions expressed as sets of equations of the form foo(nil)=... and
foo(x.u)=.... In this way one can use them without the danger of infinite
loops.
∂21-Nov-82 1558 CLT
im going to play music, back around 7
∂22-Nov-82 0900 JMC*
chainsaws
∂22-Nov-82 1114 Lynn Gotelli <CSD.GOTELLI at SU-SCORE> [John McCarthy <JMC at SU-AI>:]
Date: 22 Nov 1982 1112-PST
From: Lynn Gotelli <CSD.GOTELLI at SU-SCORE>
Subject: [John McCarthy <JMC at SU-AI>:]
To: JMC at SU-AI
Thanks for your message. Diana is now in the users and tax files
and I will have Nancy Dorio also add her to the People.Dat file.
Lynn
---------------
Mail-from: ARPANET site SU-AI rcvd at 22-Nov-82 0957-PST
Date: 22 Nov 1982 0955-PST
From: John McCarthy <JMC at SU-AI>
To: LMG at SU-AI
I have created a directory for Diana Hall as dfh
-------
∂22-Nov-82 1128 DCL Stoyan manuscript
John,
I think the part about an RA "revolt" on H54 needs some ammendments and
toning down. Also I will correct the impression that none of the early
students went on to work in LISP; at least I will have him mention my
later work in Theorem proving.
- David
∂22-Nov-82 1300 JMC*
Pass buck on Dgano and Sirovich.
∂23-Nov-82 1203 Paul Armer <CSD.ARMER at SU-SCORE> Meeting with Hastorf et al
Date: 23 Nov 1982 1142-PST
From: Paul Armer <CSD.ARMER at SU-SCORE>
Subject: Meeting with Hastorf et al
To: jmc at SU-AI, feigenbaum at SUMEX-AIM, dek at SU-AI, csd.golub at SU-SCORE,
csd.ullman at SU-SCORE, admin.gorin at SU-SCORE
Stanford-Phone: (415) 497-2906
The meeting scheduled with Hastorf,Wessels, and Lieberman had been rescheduled
fo January 11 from 4 to 5 pm in Hastorf's office. I trust this isn"t the date we
have a faculty committee scheduled. Please let me know immediately if you can
make the meeting. The December 8 meeting had to be cancalled because so many
of the CSDER's could not make it.
Paul
-------
∂23-Nov-82 1500 JMC*
Ask Yoram to handle field trip for Efron's son's class.
∂24-Nov-82 0000 JMC*
ask ME about modem and pub
∂24-Nov-82 0917 MCCARTY at RUTGERS Business Language
Date: 24 Nov 1982 1217-EST
From: MCCARTY at RUTGERS
Subject: Business Language
To: jmc at SU-AI
cc: mccarty at RUTGERS, nilsson at SRI-AI
Nils Nilsson was here at Rutgers last week, and he told me about some work
you were doing on a Common Business Communication Language (CBCL). Could you
please send me anything you have written on the subject? From Nils'
description, it sounds as if there might be some relationship between CBCL
and the representations of legal concepts which we have developed here in the
TAXMAN project. If so, I would very much like to pursue this further.
Regards,
L. Thorne McCarty
-------
∂24-Nov-82 0926 Amy Atkinson <CSD.ATKINSON at SU-SCORE> Chalkboard
Date: 24 Nov 1982 0925-PST
From: Amy Atkinson <CSD.ATKINSON at SU-SCORE>
Subject: Chalkboard
To: jmc at SU-AI
Professor McCarthy,
The carpenter is ready to hang your new chalkboard, but I wanted to check
with you concerning the size. The LCS board you currently have is 6 feet long
by 4 feet high. The chalkboard will be 6 feet long by 3 feet high. Is this
all right with you? The only other size chalkboard is 10 feet long, and you
don't have enough room in your office for that.
amy
-------
∂24-Nov-82 1000 JMC*
Elliott+Lowell
∂24-Nov-82 1042 Nancy Dorio <CSD.DORIO at SU-SCORE> pmessage
Date: 24 Nov 1982 1040-PST
From: Nancy Dorio <CSD.DORIO at SU-SCORE>
Subject: pmessage
To: jmc at SU-AI
Stanford-Phone: (415) 497-2273
Steve Barrager called to remind you of the meeting on Friday at 1:00 at
Decision Focus. He claims that the meeting will last until 3p.m.
-------
∂25-Nov-82 2235 TOB
John
This is about Amer Assoc Univ Prof. I asked your opinion.
What I know about them is that they provide some support for
faculty in questions of academic freedom. Are you a member?
Is it worth the membership to you? I am generally not
sympathetic to organizations.
Tom
I was formerly a member and dropped out about 15 years ago.
They are interested in academic freedom, and also tend
to take a trade unionist - us and them - attitude towards
university administrations. I might have dropped out when,
as I recall, they supported Bruce Franklin, but I had dropped
out some years previously. I suggest you look at some issues
of their bulletin in the library in order to determine whether
their current concerns interest you.
∂26-Nov-82 0022 TOB
John
Thanks. I am turned off by trade union activities.
I will check it out further. They will still be around
if I decide not to join now and change my mind.
Tom
∂26-Nov-82 0938 Bobrow at PARC-MAXC Re: refereeing
Date: 26 Nov 1982 09:36 PST
From: Bobrow at PARC-MAXC
Subject: Re: refereeing
In-reply-to: Your message of 22 Nov 1982 1345-PST
To: John McCarthy <JMC at SU-AI>
cc: bobrow
Kuck's paper "A logic for default reasoning" was rejected already. Thanks
anyway. Do get the Degano review back soon please.
thanks
danny
PS It was fun talking to you yesterday. I think some very relevant work to the
discussion on perceiving ambiguities only after they are pointed out is the work
on Reflective Computing being done by Brian Smith. Have you been following
that?
d.
I have been following Brian's work to some extent. At the moment I don't
see the connection. Can you say a bit more about what you think it is?
∂26-Nov-82 1559 Bobrow at PARC-MAXC Re: Connection to Brian's work
Date: 26 Nov 1982 15:59 PST
From: Bobrow at PARC-MAXC
Subject: Re: Connection to Brian's work
In-reply-to: Your message of 26 Nov 1982 0953-PST
To: John McCarthy <JMC at SU-AI>
cc: bobrow
Consider a meta circular interpreter for a system, say LISP. The code is
described in LISP, but the interpreter actually runs on a lower virtual machine
(say the compiled code for the PDP-10). If one changes the source code for the
intepreter, it does nothing to change the running of the interpreter. If one has a
system which is reflective, then it is effectively connected to the running code;
changes to the source can be made to affect how the interpreter runs.
Suppose now that one informed the interpreter of a change to one of it's
subfunctions. Then even before it has made the change to the running
interpreter, a reflective system would be aware that a change has been made;
this change could have affected how it would have run code for the last n years
(as with your bribery example). When it ran the compiler, it could then
institute the change.
If in fact the specification for the subfunction were not in LISP, but in a more
(potentially) ambiguous language, compiling would imply problem solving.
Then I think the metaphor becomes much stronger. Brian's work deals with
systems which indeed are effectively connected to their own operation, and
which both describe the system and implement it.
danny
∂27-Nov-82 1322 JJW Defining LISP functions in EKL
To: JMC, JK, YOM
In the past few days, I've been looking at various ways to represent LISP
functions as sentences in EKL. My test cases have been RAC, RDC, etc.,
and the basic premise is that one should not have to resort to saying
(axiom |∀x u.rac (x.u)=(if null u then x else rac u)|)
For a simple function like this, one might argue that the axiom is OK, but
in general, when you don't know if the function terminates, introducing such
axioms can be dangerous.
One method of defining functions is to combine the DEFINE command with the
LISTINDUCTIONDEF axiom in LISPAX. This axiom is introduced by
(decl pars (type: |ground*|))
(axiom
|∀nilcase def.
∃fun. ∀pars x u.fun(nil,pars)=nilcase(pars)∧
fun(x.u,pars)=def(x,u,fun(u,pars),pars)|)
(label listinductiondef)
My initial attempt at defining RAC was thwarted by the fact that it has no
PARS, so this axiom cannot be applied. However, we can use a simpler version:
(axiom |∀nilcase def.∃fun.fun(nil)=nilcase∧∀x u.fun(x.u)=def(x,u,fun(u))|)
(label listinductiondef1)
and then say
(define rac |rac nil=nil∧(∀x u.rac (x.u)=(if null u then x else rac u))|
(use listinductiondef1
(ue: (nilcase.|nil|) (def.|λx u a.(if null u then x else a)|))))
(label racdef)
This works, but is requires us to supply a value for RAC(NIL) in order to have a
NILCASE. Next, consider the original LISTINDUCTIONDEF for functions of more
than one argument. I tried REV, and ran into the problem that the PARS of the
recursive call REV(U,X.V) is different from the PARS in the original call
REV(X.U,V). So the LISTINDUCTIONDEF axiom is not general enough. To solve
this, I did the following:
(decl npars (type: |ground⊗ground⊗ground*→ground*|))
(axiom |∀nilcase def npars.∃fun.∀pars.fun(nil,pars)=nilcase(pars)
∧∀x u.fun(x.u,pars)=def(x,u,fun(u,npars(x,u,pars)),pars)|)
(label listinductiondef2)
NPARS can be any function expressing the new parameters in terms of the old
ones. This change, I believe, expands the functions definable with this axiom
(and similar ones for S-expressions and natural numbers) from primitive
recursive to some others, like Ackermann's function.
However, I have been unable to use this form to define REV, because EKL won't
let me substitute |λpars.pars| or |λpars.π1(pars)| for NILCASE, which is what I
want to do. JK has suggested a way to overcome this problem, but it makes the
formulas a lot more messy.
In any case, this still leaves us unable to define non-total functions, which
we want to be able to do at some point. I believe I finally understand JMC's
form of DEFINE, which would let one introduce sentences of the form
|∀args.fun(args)=def(fun,args)| and treat them as if they were axioms. The
criterion for accepting such a statement is that it does not change the set of
statements provable in the rest of the language (without the symbol FUN). Thus
in a case like |∀n.loop(n)=loop(n)+1| we would not reach any contradictions, but
would be able to prove |∀n.¬natnum(loop(n))|. However, this breaks down if you
allow any type for FUN, because if it has type TRUTHVAL, then a definition like
|∀x.fun(x)=¬fun(x)| allows EKL to prove FALSE and thus gets one into trouble.
Open question: if the type of FUN is not a subtype of TRUTHVAL, are we then OK?
But even with this, there remains the problem of dealing with loop(n)←loop(n).
It is no help to define |∀n.loop(n)=loop(n)|, because this is trivially true.
We would like to be able to derive |∀n.¬natnum(loop(n))| in some way. The only
way I know of is to introduce the use of least fixed points.
For functions of one argument, this actually has turned out to be quite easy.
Look at the following:
the proof LFP:
1. (DECL BOT (TYPE: |GROUND|) (SYNTYPE: CONSTANT))
2. (DECL (F G) (TYPE: |GROUND→GROUND|))
3. (DECL TAU (TYPE: |(GROUND→GROUND)→(GROUND→GROUND)|))
4. (DECL LFP (TYPE: |((GROUND→GROUND)→(GROUND→GROUND))→(GROUND→GROUND)|)
(SYNTYPE: CONSTANT))
;labels: LFPDEF
5. (AXIOM |∀F TAU.F=LFP(TAU)≡F=TAU(F)∧(∀G.G=TAU(G)⊃(∀A.F(A)=BOT∨F(A)=G(A)))|)
the proof PERMUT:
1. (DECL RAC (UNARYNAME: RAC) (TYPE: |GROUND→GROUND|) (SYNTYPE: VARIABLE)
(BINDINGPOWER: 950))
2. (DECL RDC (UNARYNAME: RDC) (TYPE: |GROUND→GROUND|) (SYNTYPE: CONSTANT)
(BINDINGPOWER: 950))
3. (DECL SNOC (TYPE: |(GROUND⊗GROUND)→GROUND|) (SYNTYPE: CONSTANT))
4. (DEFINE RAC |RAC=LFP(λF.(λU.(IF NULL CDR U THEN CAR U ELSE F(CDR U))))| NIL)
5. (RW 4 (USE LFPDEF (MODE: T)))
RAC=(λU.(IF NULL CDR U THEN CAR U ELSE RAC (CDR U)))∧
(∀G.G=(λU.(IF NULL CDR U THEN CAR U ELSE G(CDR U)))⊃(∀A.RAC A=BOT∨RAC A=G(A)))
6. (TRW |RAC U| (USE 5 (MODE: T)))
RAC U=(IF NULL CDR U THEN CAR U ELSE RAC (CDR U))
;labels: RACDEF
7. (UI (U) 6)
∀U.RAC U=(IF NULL CDR U THEN CAR U ELSE RAC (CDR U))
At this point we have the definition of RAC in a usable form. To save lines in
the proof, one can use DEVAL to combine the above four lines into one. Similarly,
we can define RDC:
8. (DEFINE RDC |RDC=LFP(λF.(λU.(IF NULL CDR U THEN NIL ELSE CAR U.F(CDR U))))|
NIL)
9. (RW 8 (USE LFPDEF (MODE: T)))
RDC=(λU.(IF NULL CDR U THEN NIL ELSE CAR U.RDC (CDR U)))∧
(∀G.G=(λU.(IF NULL CDR U THEN NIL ELSE CAR U.G(CDR U)))⊃
(∀A.RDC A=BOT∨RDC A=G(A)))
10. (TRW |RDC U| (USE 9 (MODE: T)))
RDC U=(IF NULL CDR U THEN NIL ELSE CAR U.RDC (CDR U))
;labels: RDCDEF
11. (UI U 10)
∀U.RDC U=(IF NULL CDR U THEN NIL ELSE CAR U.RDC (CDR U))
For SNOC, since it does not call itself, the following suffices.
;labels: SNOCDEF
12. (DEFINE SNOC |∀X U.SNOC(X,U)=U*X.NIL| NIL)
The next step is to move on to functions of more than one argument. Again I
have run into problems, and attempting to fix up LFPDEF to allow multiple
arguments has not yet succeeded. But I still believe this method will allow
us to do what is wanted. The next step after that is working is to deal with
systems of mutually recursive functions.
∂27-Nov-82 1400 JJW More
To: JMC, JK, YOM
Rather than making LFPDEF as general as possible, I decided just to add a
version for functions of two arguments; it seems reasonable to do this for
any number of arguments since there never are very many.
;labels: LFPDEF
9. (AXIOM
|∀F2 TAU2.F2=LFP2(TAU2)≡
F2=TAU2(F2)∧
(∀G2.G2=TAU2(G2)⊃(∀A B.F2(A,B)=BOT∨F2(A,B)=G2(A,B)))|)
F2, G2, TAU2, and LFP2 have all been declared using |GROUND⊗GROUND→GROUND| where
their 1-argument counterparts use |GROUND→GROUND|. Now, to define REVERSE and
REV, we can say
13. (DECL REVERSE (UNARYNAME: REVERSE) (TYPE: |GROUND→GROUND|)
(SYNTYPE: CONSTANT) (BINDINGPOWER: 950))
14. (DECL REV (TYPE: |(GROUND⊗GROUND)→GROUND|) (SYNTYPE: CONSTANT))
;labels: REVERSEREV
15. (DEFINE REVERSE |∀U.REVERSE U=REV(U,NIL)| NIL)
16. (DEFINE REV |REV=LFP2(λF2.(λU V.(IF NULL U THEN V ELSE F2(CDR U,CAR U.V))))|
NIL)
17. (RW 16 (USE LFPDEF (MODE: T)))
REV=(λU V.(IF NULL U THEN V ELSE REV(CDR U,CAR U.V)))∧
(∀G2.G2=(λU V.(IF NULL U THEN V ELSE G2(CDR U,CAR U.V)))⊃
(∀A B.REV(A,B)=BOT∨REV(A,B)=G2(A,B)))
18. (TRW |REV(U,V)| (USE 17 (MODE: T)))
REV(U,V)=(IF NULL U THEN V ELSE REV(CDR U,CAR U.V))
;labels: REVDEF
19. (UI (U V) 18)
∀U V.REV(U,V)=(IF NULL U THEN V ELSE REV(CDR U,CAR U.V))
∂29-Nov-82 0856 JJW Minimization schema and functional equations
To: JMC, JK, YOM
∂27-Nov-82 1745 JMC more
I agree that fixed numbers of arguments will cover the useful cases.
Why don't you carry your reverse example just a bit farther and
get out the minimization schema by simplification also? I can talk
about the minimization schema in class if things are in good shape
in time.
The minimization schema is essentially contained in line 17:
17. (RW 16 (USE LFPDEF (MODE: T)))
REV=(λU V.(IF NULL U THEN V ELSE REV(CDR U,CAR U.V)))∧
(∀G2.G2=(λU V.(IF NULL U THEN V ELSE G2(CDR U,CAR U.V)))⊃
(∀A B.REV(A,B)=BOT∨REV(A,B)=G2(A,B)))
unless there is a different form that you are referring to.
What is your opinion on the two ways to represent the functional equation,
namely
REV=(λU V.(IF NULL U THEN V ELSE REV(CDR U,CAR U.V)))
and
∀U V.REV(U,V)=(IF NULL U THEN V ELSE REV(CDR U,CAR U.V))
The second form seems more natural to write, but I'm not sure which one is
easier for EKL to work with. To get from the first to the second, I used the
following two steps:
18. (TRW |REV(U,V)| (USE 17 (MODE: T)))
REV(U,V)=(IF NULL U THEN V ELSE REV(CDR U,CAR U.V))
;labels: REVDEF
19. (UI (U V) 18)
∀U V.REV(U,V)=(IF NULL U THEN V ELSE REV(CDR U,CAR U.V))
but I've found that they can be replaced by one step:
20. (TRW |∀U V.REV(U,V)=(IF NULL U THEN V ELSE REV(CDR U,CAR U.V))|
(PART |1#1| (USE 17 (MODE: T))))
∀U V.REV(U,V)=(IF NULL U THEN V ELSE REV(CDR U,CAR U.V))
The (PART |1#1| ...) seems to be necessary, since otherwise EKL tries to rewrite
the right-hand side of the equation and gets into trouble. The main disad-
vantage I see with this form is that you have to repeat the functional equation
in the command line, after having already given EKL the information before.
I had already noticed that the minimization schema "essentially contained
in line 17". I guess I want an example, e.g. loop x, where line 17 gets
expanded.
∂29-Nov-82 0900 JMC*
call Pera and Sauer
∂29-Nov-82 0900 JMC*
phone pjh
∂29-Nov-82 1000 JMC*
Waltuch
∂29-Nov-82 1042 Bob Moore <BMOORE at SRI-AI> Re: references
Date: 29 Nov 1982 1042-PST
From: Bob Moore <BMOORE at SRI-AI>
Subject: Re: references
To: JMC at SU-AI
cc: BMOORE at SRI-AI
In-Reply-To: Your message of 23-Nov-82 2009-PST
John,
Re your request for references:
You are, of course, familiar with my Masters thesis. I had a few more copies
made if you would like one or two to put on reserve.
The only short piece on my doctoral thesis work is "Reasoning about
Knowledge and Action," in the 1977 IJCAI proceedings. This paper was
reprinted in READINGS IN ARTIFICIAL INTELLIGENCE, Webber and Nilsson,
eds.
My doctoral thesis (also titled "Reasoning about Knowledge and
Action") is available as an SRI technote, so I could give you several
copies of that, too.
Of my more recent work, you might be interested in "Problems in
Logical Form," from the 1981 ACL conference (also an SRI technote).
This paper is about "epistemological" problems in designing a semantic
representation for English sentences.
If I think of any more references, I'll send them to you.
--Bob
-------
I would be grateful for one copy of each of the references you mentioned.
How about your paper with Hendrix also. By the way have you seen a
Rochester PhD thesis by Andrew Haas entitled "Planning Mental Actions",
and, if so, what is your opinion of it?
∂29-Nov-82 1210 JJW Loop example
20. (DECL LOOP (UNARYNAME: LOOP) (TYPE: |GROUND→GROUND|) (SYNTYPE: CONSTANT)
(BINDINGPOWER: 950))
21. (DEFINE LOOP |LOOP=LFP(λF.(λX.F(X)))| NIL)
22. (RW 21 (USE LFPDEF (MODE: T)))
LOOP=(λX.LOOP X)∧(∀G.G=(λX.G(X))⊃(∀A.LOOP A=BOT∨LOOP A=G(A)))
23. (TRW |∀G.G=(λX.G(X))⊃(∀A.LOOP A=BOT∨LOOP A=G(A))| (USE 22))
∀G.G=(λX.G(X))⊃(∀A.LOOP A=BOT∨LOOP A=G(A))
24. (UE (G |λX.BOT|) 23 NIL)
∀A.LOOP A=BOT∨LOOP A=(λX.BOT)(A)
25. (DERIVE |∀X.LOOP X=BOT| (24) NIL)
∀X.LOOP X=BOT
∂29-Nov-82 1342 JJW 206 compiler project
People doing the LCOM4 project seem to find it very easy. Martin Giles
has turned it in already, and Su-Ming Wu talked to me this morning, to
ask if there was something that he had missed. Both of them had to write
only about 20-30 lines of extra code in the compiler. This easiness is
offset, though, by the fact that they had to learn about material not
discussed in class.
I'm not yet familiar enough with the compiler to judge whether this is
as it should be, so maybe you can look at Giles' project to see if he did
what was asked for.
∂29-Nov-82 1522 ARG brief meeting
John - When would be a good time for me to see you and get your comments on
my dissertation draft? I'm free any afternoon this week or next (except
for Thursday 2:30-3 when I'll be talking to John Hennessey about his
comments). If at all possible I'm still aiming at turning it in before
the deadline next Friday (Dec 10).
thanks,
Ron
∂30-Nov-82 0655 PJH via ROCHESTER haas thesis
its on its way. We have lots of copies.
see you
pat
∂30-Nov-82 0900 JMC*
Fordham, Walsh, Paolucci
∂30-Nov-82 1057 Bob Moore <BMOORE at SRI-AI>
Date: 30 Nov 1982 1051-PST
From: Bob Moore <BMOORE at SRI-AI>
To: JMC at SU-AI
cc: BMOORE at SRI-AI
In-Reply-To: Your message of 29-Nov-82 1324-PST
John,
I'll send you copies of all the references including the Moore and
Hendrix paper. I just got a copy of Haas's thesis in the mail last
week, and I haven't had a chance to read it yet. I imagine Kurt
Konolige will be giving it more serious study that I will, since it
seems to take the same general approach as Kurt's thesis.
--Bob
-------
∂01-Dec-82 1921 Andrei Broder <CSD.Broder at SU-SCORE> Course evaluation
Date: 1 Dec 1982 1618-PST
From: Andrei Broder <CSD.Broder at SU-SCORE>
Subject: Course evaluation
To: Autumn Instructors: ;
cc: People interested in the evaluation form: ;
Stanford-Office: MJH 325, Tel. (415) 497-1787
Dear instructors:
It's evaluation time! We would like to do the evaluations during the
next week: Tuesday, for classes meeting TTh, and Wednesday for classes
meeting MWF. Please allow 15 min at the end of your class for this
worthwhile purpose.
Please confirm this arrangement or propose another time.
Thank you.
The course evaluation ctte.
-------
∂01-Dec-82 2047 BH
Well, it turns out that either % or @ will do. If you use @ you have to
not put spaces around it, though.
∂02-Dec-82 0937 Chappell at SRI-AI TINLUNCH ON TOMORROW
Date: 2 Dec 1982 0938-PST
From: Chappell at SRI-AI
Subject: TINLUNCH ON TOMORROW
To: TINlunchers:
cc: CHAPPELL, NAVARRO, MOLENDER, ICHIKI
TINLUNCH will be held on Friday December 3, 1982 in EK242 at
lunchtime. The paper that will be discussed is
COMPETITIVE ARGUMENTATION IN COMPUTATIONAL THEORIES OF COGNITION
BY
Kert Vanlehn, John Seely Brown, and James Greeno
The authors will not be present. Copies of this week's presentation
are on Elsie Chappell's file cabinet (EJ251). On Friday, December
10th, Brian Phillips, Texas Instruments Inc. - Dallas, TX, will be
presenting his paper A MESSAGE-PASSING CONTROL STRUCTURE FOR TEXT
UNDERSTANDING coauthored with James A. Hendler.
Note: TINLUNCH will be on FRIDAYS at noon.
-------
∂02-Dec-82 1122 Bob Moore <BMOORE at SRI-AI> Haskell Curry
Date: 2 Dec 1982 1113-PST
From: Bob Moore <BMOORE at SRI-AI>
Subject: Haskell Curry
To: briansmith at PARC-MAXC, jmc at SU-AI
cc: bmoore at SRI-AI
According to a notice in the latest Journal of Philosophy, Haskell Curry
died on September 1. This is quite a shock, being less than two weeks after
the LISP conference. I hadn't heard about it and thought you might not have
heard either.
--Bob
-------
∂02-Dec-82 1505 REITER at RUTGERS Circumscription
Date: 2 Dec 1982 1806-EST
From: REITER at RUTGERS
Subject: Circumscription
To: JMC at SU-AI
Dear John,
Thanks for your note on circumscribing expressions and the Nixon paradox
solution. I am still mulling that over. In the interim, I have 2 questions:
1. In your note you remark that my version of predicate circumscription
T(P & PHI) --> (x).P(x) --> PHI(x)
is equivalent to yours. Trivially, yours implies mine by replacing PHI
in yours by P & PHI. Do you have a proof that mine implies yours? It
seems to me that your schema is more general than my particularization
of it. I am simply proposing that the particularization is all one
needs. It is simpler, and can be seen as a generalization of math.
induction to non inductively defined predicates.
2. I can't get the circumscription of an existential to work. Intuitively
circumscribing (Ex)P(x) should yield
(Ex)P(x) & (y).P(y) --> y=x
What is your solution?
Best wishes,
Ray
PS. Unfortunately, there are some personal matters in Vancouver which
require me to return. So, after Jan. 1 I can be reached at
The Dept. of Computer Science, UBC, Vancouver, BC, V6T 1W5.
-------
∂02-Dec-82 1617 Paul Armer <CSD.ARMER at SU-SCORE> [Paul Armer <CSD.ARMER at SU-SCORE>: Meeting with Hastorf et al]
Date: 2 Dec 1982 1611-PST
From: Paul Armer <CSD.ARMER at SU-SCORE>
Subject: [Paul Armer <CSD.ARMER at SU-SCORE>: Meeting with Hastorf et al]
To: jmc at SU-AI, dek at SU-AI, admin.gorin at SU-SCORE
Stanford-Phone: (415) 497-2906
can you let me know if you can make this meeting. I need to know. Paul
---------------
Date: 23 Nov 1982 1142-PST
From: Paul Armer <CSD.ARMER at SU-SCORE>
Subject: Meeting with Hastorf et al
To: jmc at SU-AI, feigenbaum at SUMEX-AIM, dek at SU-AI, csd.golub,
csd.ullman, admin.gorin
Stanford-Phone: (415) 497-2906
The meeting scheduled with Hastorf,Wessels, and Lieberman had been rescheduled
fo January 11 from 4 to 5 pm in Hastorf's office. I trust this isn"t the date we
have a faculty committee scheduled. Please let me know immediately if you can
make the meeting. The December 8 meeting had to be cancalled because so many
of the CSDER's could not make it.
Paul
-------
-------
∂02-Dec-82 2145 ARG reminder
John - Here's your reminder to bring in your copy of my dissertation.
thanks,
Ron
∂03-Dec-82 1452 RPG
∂03-Dec-82 0509 OHLANDER at USC-ISI
Date: 3 Dec 1982 0508-PST
Sender: OHLANDER at USC-ISI
From: OHLANDER at USC-ISI
To: RPG at SU-AI
Message-ID: <[USC-ISI] 3-Dec-82 05:08:47.OHLANDER>
In-Reply-To: Your message of 08 Nov 1982 1015-PST
Dick,
I am not sure where we stand right now. Have you forwarded
any draft of a proposal other than the net note you sent me? If
not, I suggest you send us a draft written proposal including the
work you have outlined. For now we will not address the portable
compiler issue. I have had some dialogue with Martin Griss about
what it would take to conform PSL to Common Lisp. He is going to
get back to me soon. I have also talked to Raj Reddy about
defining an environment for Common Lisp. He is supportive and
feels that we should all get together for a meeting. I hope to
convene one sometime after the first of the year.
Ron
∂04-Dec-82 1549 CLT
i'm off to play music, should be back between 6:30 and 7,
but perhaps you should shop with out waiting for me,
if you want to eat in.
∂04-Dec-82 1900 JDH
∂04-Dec-82 1829 JMC
I would like a copy of 204 problem writeups for this quarter.
I am not sure exactly which you want
1) the list of problems (204.tex[204,jdh])
2) my summaries of solutions (sol1.tex[204,jdh], sol2.tex[204,jdh])
3) The actual write-ups turned in (some of which have been handed back
already.)
∂05-Dec-82 0127 ME cool, man, real hot
∂05-Dec-82 0003 JMC
Downtime: 0 min., availability: 100%
No service breaks
Outside air temperature:
High -572 C., -999 F. at 0:00 on 1 Jan '64
Low 537 C., 999 F. at 0:00 on 1 Jan '64
Mean -17 C., 0 F.
ME - Looks like the "min" and "max" of a null set of data for today, no
doubt with no data yet available at 3 mins after midnight.
∂05-Dec-82 1644 Feigenbaum at SUMEX-AIM TIME FOR CS229 TOPICS IN AI COURSE
Date: 5 Dec 1982 1647-PST
From: Feigenbaum at SUMEX-AIM
Subject: TIME FOR CS229 TOPICS IN AI COURSE
To: csd.mwalker at SU-SCORE
cc: buchanan at SUMEX-AIM, genesereth at SUMEX-AIM, jmc at SU-AI
Marilynn,
The time I have chosen is Monday from 3pm to 5:30pm (to be adjusted slightly
with the students if there are a significant number of students with
a 3:05 termination of another course).
Is 352 MJH available for the course? I would prefer not to have a large
lecture hall, since the class size is likely to be about 30 people.
Let me know what classrooms are available.
There is no known conflict with the other AI courses (at least, known to me).
Ed
-------
∂06-Dec-82 0829 Darden at SUMEX-AIM experimental epistemology
Date: 6 Dec 1982 0828-PST
From: Darden at SUMEX-AIM
Subject: experimental epistemology
To: Analogy seminar:, JMC at SU-AI
Hi, Folks. I am finishing the final draft of my analogy paper and
I need help with an AI reference. Do any of you know who called
AI "experimental epistemology"? A complete reference would be
very helpful.
I'm suggesting that AI and philosophy of science form an interfield
connection to do experimental philosophy of science. Any comments?
Bye, Lindley
-------
I used the phrase "epistemological engineering" in early 60s, and I
remember that Jerome Lettvin had "epistemological engineering" on
the door of his laboratory a little later. I don't know that he
got it from me, however. "Experimental epistemology" seems to me
quite recent. Also "applied epistemology" has been used.
How are things?
∂07-Dec-82 1215 Darden at SUMEX-AIM how things are
Date: 7 Dec 1982 1218-PST
From: Darden at SUMEX-AIM
Subject: how things are
To: JMC at SU-AI
cc: Darden at SUMEX-AIM
Hi, John,
Thanks for the quick response to my message. No one else, thus far,
knows where experimental epistemology can from either. Philosophers
seem not to like the phrase, probably because they aren't happy with
talking about a computer "knowing" anything. But philosophers of
science deal with the introduction of new terms and expansion of
meanings of old ones fairly often. I don't think they are as
conservative as the epistemologists.
Life has not been good lately. My father died in October quite
suddenly of an undiagnosed (still, even after autopsy) lung degeneration.
The world is a scary place! I have retreated to work, which seems
much more within my own control. Lately I've been puzzling about
the difference between abstraction and generalization. Any ideas
on that?
I sent you a Christmas card the other day. Do you like cats?
Bye, Lindley
-------
∂07-Dec-82 1225 REITER at RUTGERS circumscription
Date: 7 Dec 1982 1521-EST
From: REITER at RUTGERS
Subject: circumscription
To: Talcott at SU-AI
cc: JMC at SU-AI
Dear Carolyn,
John has just sent me your proof that my "version" of predicate
circumscription is equivalent to his. Thanks for pointing this out to me
since I had thought that mine was strictly a special case of his. I like
the result since it reveals that circumscription can be seen as a
generalized form of mathematical induction. May I use your result (with
proper credit of course) in a paper I hope to write on this and
related issues?
Best wishes,
Ray.
-------
∂08-Dec-82 2240 Lowell Wood <LLW at S1-A> Hear Ye! Hear Ye!
Date: 08 Dec 1982 2240-PST
From: Lowell Wood <LLW at S1-A>
Subject: Hear Ye! Hear Ye!
To: "@PLAN.[DIS,S1]" at S1-A, jmc at SU-AI, gio at SU-AI,
fb at SU-AI, lsp at MIT-ML, moon@mit-oz at MIT-MC,
cent@mit-oz at MIT-MC, dlw@mit-oz at MIT-MC, cbf at MIT-ML
Ron Goldman having obtained the final signature on his PhD thesis
yesterday, Erik J. Gilbert now asserteth his claim to the title of
"Senior Stanford University Computer Science Department Graduate Student,"
with all the rights, privileges and administrative hazards thereto
pertaining. Let all who would challenge this claim now step forth and do
battle with their matriculation and since-continuous registration records,
or else acknowledge the Seniority of Erik J. Gilbert and then hold their
peace forever (or until said Erik J. Gilbert doth go to his reward or else
finally attain to PhD-hood).
All Hail EJG, the latest in the long line of holders of this proud and
ancient title! In the words of benediction of one of his most illustrious
predecessors as Senior, "May his tenure not be so long as to be
unpleasant, but of sufficient duration to tax the memory!"
∂08-Dec-82 2252 WIEDERHOLD at SUMEX-AIM Re: Hear Ye! Hear Ye!
Date: 8 Dec 1982 2251-PST
From: WIEDERHOLD at SUMEX-AIM
Subject: Re: Hear Ye! Hear Ye!
To: LLW at S1-A
cc: @PLAN.[DIS,S1] at S1-A, jmc at SU-AI, gio at SU-AI, fb at SU-AI,
lsp at MIT-ML, moon at MIT-OZ at MIT-MC, cent at MIT-OZ at MIT-MC,
dlw at MIT-OZ at MIT-MC, cbf at MIT-ML
In-Reply-To: Your message of 8-Dec-82 2240-PST
o yea. o yea. gio
-------
∂09-Dec-82 0845 BUCHANAN at SUMEX-AIM Re: experimental epistemology
Date: 9 Dec 1982 0847-PST
From: BUCHANAN at SUMEX-AIM
Subject: Re: experimental epistemology
To: Darden at SUMEX-AIM
cc: JMC at SU-AI
In-Reply-To: Your message of 6-Dec-82 0828-PST
Lindley,
I first remember Ed Feigenbaum and Donald Michie using the term
"epistemological engineering" in conversation about 1972. All three of
us thought it was too hard for people to say and not long after that
Ed began using "knowledge engineering". "Applied epistemology" was
used too, but I don't recall "experimental epistemology", although in
retrospect it would have been quite appropriate.
As for a reference in print, I'd look at stuff that Donald was
writing in the 1972-75 period. I don't know if it ever appeared
in print, though.
best regards,
bgb
-------
∂09-Dec-82 0920 JJW 206
Several people have asked me about taking an incomplete. I've told
them it will be possible. In most cases, it's so that they can complete
the project.
∂09-Dec-82 1339 Jeff Rubin <JBR at S1-A> terminal recommendation
Date: 09 Dec 1982 1339-PST
From: Jeff Rubin <JBR at S1-A>
Subject: terminal recommendation
To: jmc at SU-AI
∂09-Dec-82 1153 John McCarthy <JMC at SU-AI> terminal recommendation
Date: 09 Dec 1982 1148-PST
From: John McCarthy <JMC at SU-AI>
Subject: terminal recommendation
To: jbr at S1-A
I want to replace my Datamedia home terminal by something to be used
with SAIL. Do you have a current recommendation of a terminal
or of an expert? I was quite happy with the Ambassador with the M.I.T.
keyboard, but I don't know how hard it is to get a suitable combination
for use over phone lines. Am I correct that the S-1 people all prefer
to come in rather than work from home?
[jbr:
I think Erik Gilbert sometimes dials in but most everyone comes in.
I am not an expert but I think the Ambassador with the ability to use
the pause key like a Datamedia edit key isn't bad. I believe that is
now an available option from Ann Arbor and it should easily be usable
over phone lines.
]
Does the Ambassador so equipped handle the SAIL character set?
∂10-Dec-82 0900 JMC*
miller 011 353 1 804838
∂10-Dec-82 1522 Jeff Rubin <JBR at S1-A>
Date: 10 Dec 1982 1520-PST
From: Jeff Rubin <JBR at S1-A>
To: jmc at SU-AI
∂09-Dec-82 2326 John McCarthy <JMC at SU-AI>
Date: 09 Dec 1982 2324-PST
From: John McCarthy <JMC at SU-AI>
To: jbr at S1-A
Does the Ambassador so equipped handle the SAIL character set?
Ours don't appear to. Best to ask EJG.
∂10-Dec-82 1840 EJG WAITS dialup terminals
To: JMC
CC: ZM
∂10-Dec-82 1643 JMC telephone terminal
I want to replace my Datamedia by something better for using SAIL over
a phone line. Jeff Rubin thought you might know something about whether
there is some way of getting an Ambassador or something else better than
a Datamedia to handle the SAIL character set.
[John, I own an Ambassador for use at home, and am quite happy with it.
It's main features are an up to 60 line display, reasonable programmability
of keyboard (but not every key, only about 10 standard chars plus about
20 special keys), and price (about $1400 excluding modem). It does *not*
support a split-speed (1200/150) modem, but 1200/1200 is more typical
these days anyway.
It's main disadvantage w.r.t. use on SAIL is character set support.
It does *not* have a WAITS keyboard like the WAITS DM layout, although
my keyboard programming makes things like (CONTROL)(META) and [BREAK]
into a single keystroke. I still have to remember (or look up in a table)
that CTRL-O is a partial sign, etc. *Also*, it is apparently quite
difficult to reprogram the character set to print special graphics
in addition to the normal set. Changing an existing graphic requires
only reblowing PROMs, but extending the set (e.g. to SAIL) would
probably require Z-80 microcode changes which I don't know how
to do (no sources). (I am thinking about hacking on a disassembled
version for exactly this reason, but that's still pretty iffy.)
So, the SAIL graphics either print as boldface normal chars or reverse
video normal chars, depending on an option setting.
The Concept-100, and presumably the more modern Concept-108, *can*
have their charset PROMs easily upgraded to the SAIL character set.
I've seen a C-100 set up this way at LLNL. Don Woods also owns one.
The Concept keyboards have a kind of funny "feel," if you ask me,
but some people like them. There are two C-108's in MJH 408 that
are connected to Diablo if you want to try typing on one.
ZM talked to me just today (after talking to ME) about the Ambassador,
and seems to have decided on just getting a DM because he uses the
special SAIL characters a lot. I forgot to mention the C-100 to him,
and so am CC'ing this message. Remember, it still doesn't have the
SAIL characters printed on the keycaps.
Other people with more information on current terminals include
HWC and JMB at LLNL.
A lot of TOB's group use Ambassadors at home, e.g. DHM and ML.
PN also has one.
The Center for Integrated Systems folks use Concepts a lot, as
do Rob Poor and friends at Sprocket Systems division of LucasFilms.
Neither of these groups uses WAITS much, though.
End of memory dump,
- Erik]
∂10-Dec-82 2019 IAZ
I'll bring it here tomorrow.
The bike is pale green and will be parked by the rear door.
I'll send you a message when it is there.
∂11-Dec-82 1718 JJW 206 final
I am having a hard time coming up with questions for the final. Can
you suggest a general type of question that you would like to see?
∂12-Dec-82 0113 JJW 206 final
I mailed some ideas for exam questions to JMC%S1.
∂13-Dec-82 1706 TVR MAIL
It can send mail to hosts we're not directly connected to, such as Chaosnet
sites. It depends on knowing a specific host to do the forwarding, and
those who recieve messages may not know how to reply. I wanted to work out
some of these issues before announcing it.
--- Tovar
∂13-Dec-82 2225 CSL.CRC.EJM@SU-SCORE (SuNet) Re: tenure
Date: 13 Dec 1982 0731-PST
From: Edward J. McCluskey <CSL.CRC.EJM at SU-SCORE>
Subject: Re: tenure
To: JMC at SU-AI
In-Reply-To: Your message of 19-Nov-82 1024-PST
tenure
I don't believe that effort involved in doing an honest job is
so tough.
Documenting things for the big U (deans, provosts, vices, presidents
trustworthies, etc.) may be.
It's important not to neglect this issue since it's what will prevent
Stanford CSD from going the way of Penn. Mich. MIT, ILL,...
-------
∂14-Dec-82 1240 CSD.ARMER@SU-SCORE (SuNet) [The Mailer Daemon <Mailer at SU-SCORE>: Message of 13-Dec-82 11:19:49]
Date: 14 Dec 1982 1127-PST
From: Paul Armer <CSD.ARMER at SU-SCORE>
Subject: [The Mailer Daemon <Mailer at SU-SCORE>: Message of 13-Dec-82 11:19:49]
To: jmc at SU-AI
Stanford-Phone: (415) 497-2906
For your information.
---------------
Date: 13 Dec 1982 2237-PST
From: The Mailer Daemon <Mailer at SU-SCORE>
To: CSD.ARMER at SU-SCORE
Subject: Message of 13-Dec-82 11:19:49
Message failed for the following:
jmc at SU-AI: Sender not given.
RWF at SU-AI: Sender not given.
------------
Date: 13 Dec 1982 1119-PST
From: Paul Armer <CSD.ARMER at SU-SCORE>
Subject: Lack of Progress
To: csd.olumi at SU-SCORE
cc: csd.rwf at SU-SCORE, csd.wiederhold at SU-SCORE, jmc at SU-AI
Stanford-Phone: (415) 497-2906
Mr. Mohammad Olumi December 13, 1982
P.O. Box 10433
Stanford, CA 94305
Dear Mr. Olumi:
The Department of Computer Science is concerned about your lack of
progress towards a CSMS Degree as evidenced by your failure to pass
the comprehensive exam on five occasions and by your failure to pass
the programming part of the exam despite four trials. The Graduate
Studies Committee has concluded that unless you pass both the written
portion and the programming part of the comprehensive exam by the end
of the Winter Quarter, you will be dismissed from the program for
lack of progress. A representative of the committee will meet with
you and your advisor to discuss this with you.
If you have any questions about this, please come see me. You will also
be getting a hard copy version of this letter.
Sincerely yours,
Paul Armer
Associate Chairman
cc: John McCarthy
Gio Wiederhold
Robert Floyd
-------
-------
-------
∂14-Dec-82 2143 Don Walker <WALKER at SRI-AI> [The Mailer Daemon <Mailer at SRI-AI>: Message of 14-Dec-82 13:55:59]
Date: 14 Dec 1982 2144-PST
From: Don Walker <WALKER at SRI-AI>
Subject: [The Mailer Daemon <Mailer at SRI-AI>: Message of 14-Dec-82 13:55:59]
To: jmc at SU-AI
Mail-From: SCOTT created at 14-Dec-82 21:26:43
Date: 14 Dec 1982 2126-PST
From: The Mailer Daemon <Mailer at SRI-AI>
To: WALKER at SRI-AI
Subject: Message of 14-Dec-82 13:55:59
Message failed for the following:
jmc-list at SU-AI: 450 I don't know anybody named jmc-list
------------
Date: 14 Dec 1982 1355-PST
From: Don Walker <WALKER at SRI-AI>
Subject: Tinlunch for 17 December
To: TINlunchers: ;
cc: Chappell at SRI-AI
TINLUNCH will be held on Friday , December 17, 1982 in room EK242 at
lunchtime. The paper that will be discussed is
Grammars as Mental Representations of Language
by
Joan Bresnan and Ronald M. Kaplan
The authors will be present. Copies of this week's presentation
are on Elsie Chappell's file cabinet (EJ251).
Note: TINLUNCH now are on FRIDAY'S at noon.
Apologies for the lateness of this announcement; the information and
the paper were turned in to the system two weeks ago. It failed us.
-------
-------
-------
∂14-Dec-82 2252 JJW 206 final
The exam books are in my desk. A couple of smart people finished early,
but most stayed for the full three hours, and I got comments that it was
harder than the midterm. One problem arose: Winfried Harbecke unluckily
got an exam that had only copied on one side, so he didn't realize that
there were 6 problems until very near the end. I told him that we would
take this into consideration. He did sketch answers to the last 2
problems in his exam book.
I also have term projects from a number of people.
∂14-Dec-82 2317 Woody Bledsoe <ATP.Bledsoe at UTEXAS-20> ATP Session in Denver
Date: 14 Dec 1982 1359-CST
From: Woody Bledsoe <ATP.Bledsoe at UTEXAS-20>
Subject: ATP Session in Denver
To: jmc at SU-AI, davism.acf1 at NYU, dwl.duke at UDEL-RELAY,
peter.andrews at CMU-CS-A, lenat at SU-AI, cl.boyer at UTEXAS-20,
oppen at PARC-MAXC, nilsson at SRI-AI
cc: ATP.Bledsoe at UTEXAS-20
14 Dec 1982
Program for The Automatic Theorem Proving Session at the Denver AMS Meeting
January 5-6, l983
SCHEDULE
The schedule is now set.
The Session on Proof Theory, organized by Irving Anellis (instead
of Don Monk) Will be held on Weds and Thurs Mornings, Jan 5-6, and
Paul Bateman has scheduled our meeting in the afternoons in order to
avoid conflits with them.
Wednesday, Jan 5, 2:30 - 6:20
2:30 Donald Loveland (Brief Historical Overview of ATP) 20 Min
Automated Theorem Porving: a quarter-century review.
Preliminary report.
3:00 Hoa Wang (milestone winner) 40 Min + 20 min break
Automatic Theorem Proving and Aritficial Intelligence.
Introduced by Martin Davis
4:00 Larry Wos (Wos and Winker, current winners) 40 Min + 20 min
Open Questions Solved with the Assistance of AURA
Introduced by Nils Nilsson
5:00 Bob Boyer 20 Min + 10 min
Automatic Theorem Proving for Recursive Functions
5:30 Doug Lenat 20 Min + 10 min
Can Machines Conjecture?
6:00 Derek Oppen 20 min + 10 min
Decidable theories in Theorem Proving
Thursday, Jan 6, 2:15 - 4:45
2:15 John McCarthy 20 min + 10 min
Non-monotonic reasoning and Common Sense Inference
2:45 Peter Andrews 20 Min + 10 min
Automating Higher Order Logic
3:15 Dallas Lankford 20 min + 10 min
An efficient elementary abelian group unification algorithm
3:45 Woody Bledsoe 20 min + 10 min
Some Automatic Proofs in Analysis
4:15 Informal Discussion 20 min
(We expect to substitute here talk by Chang-Ching Chow, on
the Wu theorem proving method)
This is the annual meeting of the American Mathematical
Society. The full AMS meeting runs Jan 5-9, l983.
The ATP Prize committee meets at noon Thursday, Jan 6.
W. Bledsoe
The people at AMS Headquarters mentioned that we might want
collect the papers from the ATP Spectial Session into a volume. Is there
any interest in doing that? I'm half inclined to do it you each of
you (or most of you) agree, because it would provide a look at ATP to the
mathematics community, without a lot of reading on their parts.
Also one is often asked for papers summarizing his talk after such a
session, so it is handy to have the papers (at least) to send out, and
also the whole set of papers in one volume. I would presume that each
speak would provide a slightly expanded version of his talk. (Or somewhat
longer version if he wanted).
I don't have all the details yet but will get them if
you show interest. AMS would publish the book if it approved by the
Contemporary Mathematics Editor (Prof James Milgram - Stanford) or
we could easily get someone else to publish it ,I believe. We can
get the AMS approval ahead of time if we go that route. Papers
for the AMS volumes usually run from 10 to 20 pages, but there is
a lot of leeway. Larry Wos and I like the idea.
14 December 1982
Most of the authors have responded and these have opted for
publication of the volume. I have talked to Prof Milgram, and he said
that his commitee would be glad to review our case when they meet
early next year. I have sent him copied of the abstracts and a couple
of the papers to give them an idea of what would be published. I am
sending each of you the AMS instructions for publications in case we
go that way. If AMS does not want to publish it (they have first refusal)
then we can easily go to MIT press or some other publisher I believe,
if you want to do that. We can decide that after we hear from AMS.
Merry Christmas! See you in Denver.
WB
-------
∂15-Dec-82 0804 MDD via NYU
To: JMC at SU-AI, norm at RAND-UNIX, fisher at YALE,
bledsoe at UTEXAS-20
CC: davism.acf1 at NYU
COMMUNICATING WITH MARTIN DAVIS ON THE ARPA-NET
1. I will be in Italy January 8 through February 12.
2. Because NYU is changing systems, there will be a period
beginning January 1, 1983 (and hopefully ending by February 12)
when I will not be able to use the ARPA-NET from NYU. This means that
I won't be able to send messages, and also that I won't be able to
receive messages at my SU mailbox. However I will continue to be able
to receive messages at my NYU mailbox: DAVISM.ACF1@NYU.
3. It has just been brought to my attention (by a message
from Yale) that this is not just a local NYU problem. For any who
are interested: the ELF which has been our ARPA-connection will
no longer be supported and will go away on Jan. 1. Our new system
will be via a VAX running UNIX. -Martin Davis
∂15-Dec-82 1414 CSD.BSCOTT@SU-SCORE (SuNet) [MCKENNEY at USC-ISI: Re: AO 4582]
Date: 15 Dec 1982 1345-PST
From: Betty Scott <CSD.BSCOTT at SU-SCORE>
Subject: [MCKENNEY at USC-ISI: Re: AO 4582]
To: CSD.Ullman at SU-SCORE, CSD.Genesereth at SU-SCORE, CSL.JLH at SU-SCORE,
JMC at SU-AI, Rindfleisch at SUMEX-AIM
For your information, this is the response to my inquiry as to the status
of the ARPA Equipment Proposal. It will take some time to get it through
DSSW after they get the ARPA Order. - Betty
---------------
Mail-from: ARPANET site USC-ISI rcvd at 15-Dec-82 0731-PST
Return-path: MCKENNEY@USC-ISI
Date: 13 Dec 1982 1041-PST
Sender: MCKENNEY at USC-ISI
Subject: Re: AO 4582
From: MCKENNEY at USC-ISI
To: CSD.BSCOTT at SU-SCORE
Message-ID: <[USC-ISI]13-Dec-82 10:41:44.MCKENNEY>
In-Reply-To: Your message of 10 Dec 1982 1611-PST
Betty,
The arpa order to withdraw the money from ONR has been signed.
The dollars have not come back in house, however. Hopefully this
will not be too much longer (before Christmas?) The arpa order
to DSSW will go out immediately after the money gets returned.
Dona
-------
∂15-Dec-82 1933 Robert C. Berwick <BERWICK at MIT-MC>
Date: 15 December 1982 20:25-EST (Wednesday)
Sender: BERWICK at MIT-OZ
From: Robert C. Berwick <BERWICK at MIT-MC>
To: John McCarthy <JMC at SU-AI>
In-reply-to: The message of 15 Dec 1982 19:18-EST from John McCarthy <JMC at SU-AI>
If you want to send messages to Harry directly,
just send them to Berwick.bradford@mit-oz@mit-mc
(Actually, you should try this and see if it works --
but it should.)
Bob Berwick
This is a test to see if address works.
∂01-Jan-83 0001 JMC*
Call Suppes about lunch re CBCL, etc.
∂16-Dec-82 1202 Edward C. Pattermann <PATTERMANN at SUMEX-AIM>
Mail-from: ARPANET site SUMEX-AIM rcvd at 16-Dec-82 1209-PST
Date: 16 Dec 1982 1124-PST
From: Edward C. Pattermann <PATTERMANN at SUMEX-AIM>
To: EWANG at SUMEX-AIM, TAJNAI at SUMEX-AIM, DE2SMITH at SUMEX-AIM,
SEAMONS at SUMEX-AIM, BSCOTT at SUMEX-AIM, MROBERTS at SUMEX-AIM,
PRATT at SUMEX-AIM, MOGUL at SUMEX-AIM, JMCCARTHY at SUMEX-AIM,
MEYERS at SUMEX-AIM, MARCUSON at SUMEX-AIM, LENAT at SUMEX-AIM,
LANTZ at SUMEX-AIM, LAGERWERFF at SUMEX-AIM, KUHN at SUMEX-AIM,
IWASAKI at SUMEX-AIM, HWANG at SUMEX-AIM, BHAYES-ROTH at SUMEX-AIM,
HAILPERN at SUMEX-AIM, HAKEN at SUMEX-AIM, GOTELLI at SUMEX-AIM,
GORIN at SUMEX-AIM, GENESERETH at SUMEX-AIM, GARDNER at SUMEX-AIM,
FREEMAN at SUMEX-AIM, JFINGER at SUMEX-AIM, EPPSTEIN at SUMEX-AIM,
ELSCHLAGER at SUMEX-AIM, DIETTERICH at SUMEX-AIM, CRISPIN at SUMEX-AIM,
PCOHEN at SUMEX-AIM, CLAYTON at SUMEX-AIM, CAVALLI-SFORZA at SUMEX-AIM,
JBROWN at SUMEX-AIM, BIZZARRI at SUMEX-AIM, BENNETT at SUMEX-AIM,
BASKETT at SUMEX-AIM, BARR at SUMEX-AIM, ROSENOW at SUMEX-AIM,
MCGOVERAN at SUMEX-AIM, HAZEN at SUMEX-AIM, KARP at SUMEX-AIM,
JQJOHNSON at SUMEX-AIM, GOLUB at SUMEX-AIM, ELMASRI at SUMEX-AIM,
BOCK at SUMEX-AIM
cc: cmiller at SUMEX-AIM, ryalls at SUMEX-AIM
Subject: mail forwarded to Score
This message is addressed to those users who have mail forwarded from SUMEX
to SCORE. Since SCORE is shutting down on December 18th for two weeks, please
let us know whether or not you would like your mail forwarded elsewhere. By
default, we will arrange it so that those who have accounts at SUMEX will
have their mail stay here and not forwarded.
Please send your change requests to HELP@SUMEX.
Thanks,
Ed
-------
If the JMCCARTHY@SUMEX is me, mail should be (and should have been)
forwarded to JMC@SAIL. Actually I didn't know I had an account at
SUMEX. I might use it once in a great while if I knew its password.
∂17-Dec-82 1400 JMC*
Quate
∂17-Dec-82 2300 JMC*
Check home for IBM writeup, Lee name.
∂18-Dec-82 1814 JK new ekl
To: JMC, JJW
There is a new EKL up with empty types, handling of associativity in
rewriting, a generalized notion of universal elimination and other
goodies.
∂18-Dec-82 1819 JK
∂18-Dec-82 1817 JMC new ekl
To: JK, JJW
Is the new EKL called EKL, and what is the state of writeup?
---------
I am just finishing the write up (its EKL.MAN[EKL,JK].)
∂18-Dec-82 1823 JK new ekl
To: JJW, JMC
The documentation is up dated and can be found in EKL.MAN[EKL,JK].
The use of functions of no variables can be painful since the
parser cannot yet handle constructs like λ.foo. xsystem is still called EKL.
∂19-Dec-82 1231 JJW 206
∂19-Dec-82 0123 JMC
I'll come in and help finish off this morning or afternoon.
JJW - I'm almost done with the finals. The remaining big task is
to look at people's projects. The ones I have so far are:
14 algebraic simplification
4 let-by-need
4 LCOM4
1 EKL samefringe
1 matrix operations
∂20-Dec-82 2242 RPG Arpa proposal
Is just about done except for a major problem. I think that
it is difficult to do a completely plausible Blue pages (definition
of Common Lisp in Common Lisp) without a portable compiler, or at least
a skeleton of one for people to work from. To do this I'll need a
research associate and 2 grad students, or a research associate and
a programmer. In addition, a Lisp machine would make things much
easier. Ohlander wanted to see a $100k per year budget, and the
compiler doubles without capital equipment.
Do you think I ought to stay austere, go for everything, or
propose various levels and let them take their pick, explaining
what they get for what level of support? Also, should I be honest about
the need to hire someone from a thin array of candidates?
-rpg-
The formal proposal has to contain exactly what they decide to give you.
Indeed whenever they want to change something in a proposal, they make
us submit a new one proposing what they intend to give us. I suppose
the idea is that when the proposal goes up to the Director of ARPA,
there should be no confusion about "they propose A, but we want to
give them B".
However, you can send Ohlander a message saying whatever you think
appropriate.
∂20-Dec-82 2252 RPG Ok
So I'll probe Ohlander with the question and see what he says.
-rpg-
∂21-Dec-82 0900 JMC*
lindley 601 534-4163
∂21-Dec-82 2010 TOB industrial professor
To: JMC, TOB
I have some candidates. I will contact them if
it is still a possibility.
I have only one definite candidate so far, and I want to
get them in time to put the course descriptions in the catalog, so
go ahead.
∂22-Dec-82 0041 100 on TTY161 0041: pourne@mc via USC-TAC
mc dead. Tried to log in to this host, but it no longer
recognizes jxp as legal and doesn't know my password. Any
advice? Also, remind you, SILICON BRAINS
anthology is in preparation, hope you will have about 5000 words
for it...
J E Pournelle
Jerry: According to finger, JXP still exists as Jerry Pournelle and
last logged in on Oct. 28. Can't check further without a password.
If you get this in time before I leave for Seattle Thursday at 2pm
phone me at 415 497-4430 or 857-0672 and we'll investigate further.
I don't remember about Silicon Brains, but I guess everything but
timing is evident from the title. It's possible.
∂24-Dec-82 0031 Jerry E. Pournelle <POURNE @ MIT-MC>
Date: 24 December 1982 03:30-EST
From: Jerry E. Pournelle <POURNE @ MIT-MC>
To: JMC @ SU-AI
In-reply-to: The message of 22 Dec 1982 1048-PST from John McCarthy <JMC at SU-AI>
Hope you can be in Silicon Brains. Will discuss the net
connection when you get back. Wasn't able to get on in time.
Power failures here and like that. Best,
jep
∂27-Dec-82 1209 DCL ARPA proposal
To: TOB at SU-AI
CC: DCL at SU-AI, JMC at SU-AI, ZM at SU-AI,
wiederhold at SUMEX-AIM, MAS at SU-AI, RBA at SU-AI
Betty Scott asked me to pass on a reminder that the amalgamated
ARPA proposal for FY84, FY85 should be ready to go to ARPA by Januray 31st.
Currently they are taking 9 months to process the paper work once it is
approved.
Marianne has kindly agreed to coordinate as she did last time; Rosemary
Brock will help.
- David
∂28-Dec-82 1348 DE2SMITH at SUMEX-AIM Re: Ordering conjuncts ...
Date: 28 Dec 1982 1334-PST
From: DE2SMITH at SUMEX-AIM
Subject: Re: Ordering conjuncts ...
To: JMC at SU-AI
cc: mrg at SU-HNV
In-Reply-To: Your message of 21-Dec-82 1653-PST
I have recently become familiar with most of the PROLOG work you mention, as
well as other work among the data base community. The most interesting is
David Warren's paper entitled "Efficient Processing of Interactive Relational
Database Queries Expressed in Logic", from VLDB 7, 1981. I recommend it.
The paper you read is nearly a year old and therefore needs extensive
revision to reflect my recent thoughts and study of the literature.
It is on my stack of things to do during January. I will bring one by
just as sooon as it is available. In the interim, beware of typos in
the formulae. I'm aware of several. Your interest is appreciated,
and I welcome your comments and suggestions.
Happy Holidays,
D. E. Smith
-------
∂28-Dec-82 1605 DFH
To: JMC, DFH
Dr. Teller has to move his appt. with you on Friday to 1:30 pm
(rather than 2:30 pm) if you are to have two hours. He had
to schedule something else at 3:30 pm.
∂01-Jan-83 1122 Gene Golub <CSD.GOLUB@SU-SCORE.ARPA> Re: SAIL configuration
Date: Sat 1 Jan 83 11:16:47-PST
From: Gene Golub <CSD.GOLUB@SU-SCORE.ARPA>
Subject: Re: SAIL configuration
To: JMC@SU-AI.ARPA
cc: admin.gorin@SU-SCORE.ARPA, csd.bscott@SU-SCORE.ARPA
In-Reply-To: Your message of Fri 31 Dec 82 18:10:00-PST
This seems fine with me. GENE
-------